Numerische Mathematik

, Volume 1, Issue 1, pp 269–271

A note on two problems in connexion with graphs

  • E. W. Dijkstra
Article

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Kruskal Jr., J. B.: On the Shortest Spanning Subtree of a Graph and the Travelling Salesman Problem. Proc. Amer. Math. Soc.7, 48–50 (1956).Google Scholar
  2. [2]
    Loberman, H., andA. Weinberger: Formal Procedures, for Connecting Terminals with a Minimum Total Wire Length. J. Ass. Comp. Mach.4, 428–437 (1957).Google Scholar
  3. [3]
    Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956.Google Scholar
  4. [4]
    Berge, C.: Théorie des graphes et ses applications, pp. 68–69 Paris Dunod 1958.Google Scholar

Copyright information

© Springer-Verlag 1959

Authors and Affiliations

  • E. W. Dijkstra
    • 1
  1. 1.Mathematisch CentrumAmsterdam-O

Personalised recommendations