20kAccesses
111Altmetric
7Mentions
This is a preview of subscription content,log in via an institution to check access.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price includes VAT (Japan)
Instant access to the full article PDF.
References
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).
Loberman, H., andA. Weinberger: Formal Procedures, for Connecting Terminals with a Minimum Total Wire Length. J. Ass. Comp. Mach.4, 428–437 (1957).
Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956.
Berge, C.: Théorie des graphes et ses applications, pp. 68–69 Paris Dunod 1958.
Author information
Authors and Affiliations
Mathematisch Centrum, 2e Boerhaavestraat 49, Amsterdam-O
E. W. Dijkstra
- E. W. Dijkstra
You can also search for this author inPubMed Google Scholar
Rights 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
Received:
Issue Date:
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative