Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

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
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
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