Skip to main content
Log in

A note on two problems in connexion with graphs

Numerische Mathematik Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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. 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. Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956.

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

    Google Scholar 

Download references

Author information

Authors and 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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01386390

Keywords

Navigation