×

zbMATH — the first resource for mathematics

A note on two problems in connexion with graphs. (English) Zbl 0092.16002

MSC:
90C35 Programming involving graphs or networks
Keywords:
topology
PDF BibTeX XML Cite
Full Text: DOI EuDML
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). · Zbl 0070.18404
[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] Ford, L. R.: Network flow theory. Rand Corp. Paper, P-923, 1956. · Zbl 0073.40203
[4] Berge, C.: Théorie des graphes et ses applications, pp. 68-69 Paris Dunod 1958.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.