Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

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

Joseph B. Kruskal, Jr.
Proceedings of the American Mathematical Society
Vol. 7, No. 1 (Feb., 1956), pp. 48-50
DOI: 10.2307/2033241
Stable URL: http://www.jstor.org/stable/2033241
Page Count: 3
  • More info
  • Cite this Item
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Preview not available

Page Thumbnails

  • Thumbnail: Page 
48
    48
  • Thumbnail: Page 
49
    49
  • Thumbnail: Page 
50
    50