Skip to content

On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem

Joseph B. Kruskal

Proceedings of the American Mathematical Society · 1956 · 5,572 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7(1), 48. https://doi.org/10.1090/s0002-9939-1956-0078686-7

In text: (Kruskal, 1956)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J. Levitzki, On the radical of a general ring, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 462^66. 9. -, On three problems concerning nil rings, Bull. Amer. Math. Soc. vol. 49 (1943) pp. 913-919. 10. -, On the structure of algebraic algebras and related rings, Trans. Amer. Math. Soc. vol. 74 (1953) pp. 384-409.

  1. Introduction to Algorithms1991
  2. A Formal Basis for the Heuristic Determination of Minimum Cost Paths1968
  3. Network Flows: Theory, Algorithms, and Applications.1994
  4. Network information flow2000
  5. Depth-First Search and Linear Graph Algorithms1972

Metadata from OpenAlex (CC0). Citations are generated from the published record.