A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959
Cited by 24,043 works.
doi:10.1007/bf01386390
Authors
E. Dijkstra
References
On the shortest spanning subtree of a graph and the traveling salesman problem
Théorie des graphes et ses applications
Formal Procedures for Connecting Terminals with a Minimum Total Wire Length