Skip to main content

A note on two problems in connexion with graphs

This is a preview of subscription content, access via your institution.

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.

  4. [4]

    Berge, C.: Théorie des graphes et ses applications, pp. 68–69 Paris Dunod 1958.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Dijkstra, E.W. A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959). https://doi.org/10.1007/BF01386390

Download citation

Keywords

  • Mathematical Method