Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1283| Title: | Shortest route algorithms for sparsely connected networks |
| Authors: | Defenderfer, Joe Edmund. |
| Keywords: | TK7855.M41 E386 no.683 Network analysis (Planning) Computer networks Algorithms |
| Issue Date: | 1-Jun-2013 |
| Publisher: | Electronic Systems Laboratory, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology |
| Description: | by Joe E. Defenderfer. Bibliography: p. 71. Prepared under Contract ONR/N00014-75-C-1183. |
| URI: | http://koha.mediu.edu.my:8181/jspui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/1283 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.