On the shortest spanning subtree of a graph and the traveling salesman problem (Q115238)

From MaRDI portal
Revision as of 11:16, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the shortest spanning subtree of a graph and the traveling salesman problem
scientific article

    Statements

    volume
    7
    0 references
    issue
    1
    0 references
    page(s)
    48-50
    0 references
    publication date
    1956
    0 references
    author
    Joseph B. Kruskal
    0 references
    Joseph B. Kruskal
    0 references
    title
    On the shortest spanning subtree of a graph and the traveling salesman problem (English)
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    90C35
    0 references
    05C85
    0 references
    zbMATH DE Number
    3117235
    0 references
    zbMATH Keywords
    topology
    0 references
    Wikidata QID
    Q55933607
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q115238&oldid=27596487"
    Powered by MediaWiki