Shortest route algorithms for sparsely connected networks

Author: Defenderfer, Joe Edmund.

Citable URI: http://hdl.handle.net/1721.1/1283

Publisher: Electronic Systems Laboratory, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology

Date Issued: 1976

Description:

Bibliography: p. 71.Prepared under Contract ONR/N00014-75-C-1183.

Series/Report no.: Report (Massachusetts Institute of Technology. Electronic Systems Laboratory) ; ESL-R-683.

Keywords: TK7855.M41 E386 no.683, Network analysis (Planning), Computer networks, Algorithms

Files in this item

Name	Size	Format	Description
R-0683-03499448.pdf	2.687Mb	PDF

LIDS Technical Reports
The Laboratory for Information and Decision Systems Technical Report Series

MIT-Mirage