Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A note on two problems in connexion with graphs

This is a preview of subscription content, log in to check access.

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).

  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).

  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.

Download references

Author information

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