NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.06 seconds)

Spelling suggestions: "subject:"tk7855.141 386 no.683"" "subject:"tk7855.141 1386 no.683""

1

Shortest route algorithms for sparsely connected networks

January 1976 (has links)
by Joe E. Defenderfer. / Bibliography: p. 71. / Prepared under Contract ONR/N00014-75-C-1183.
TK7855.M41 E386 no.683
Computer networks
Network analysis (Planning)
Algorithms

Page generated in 0.062 seconds