DSpace Repository

Shortest route algorithms for sparsely connected networks

Show simple item record

dc.contributor Defenderfer, Joe Edmund.
dc.date 2002-06-21T03:40:07Z
dc.date 2002-06-21T03:40:07Z
dc.date 1976
dc.date.accessioned 2013-05-31T16:38:41Z
dc.date.available 2013-05-31T16:38:41Z
dc.date.issued 2013-06-01
dc.identifier http://hdl.handle.net/1721.1/1283
dc.identifier.uri http://koha.mediu.edu.my:8181/jspui/handle/1721
dc.description by Joe E. Defenderfer.
dc.description Bibliography: p. 71.
dc.description Prepared under Contract ONR/N00014-75-C-1183.
dc.format 73 p.
dc.format application/pdf
dc.language eng
dc.publisher Electronic Systems Laboratory, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
dc.relation Report (Massachusetts Institute of Technology. Electronic Systems Laboratory) ; ESL-R-683.
dc.subject TK7855.M41 E386 no.683
dc.subject Network analysis (Planning)
dc.subject Computer networks
dc.subject Algorithms
dc.title Shortest route algorithms for sparsely connected networks


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account