On the shortest spanning subtree of a graph and the traveling salesman problem (Q115238): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / DOI
 
Property / DOI: 10.1090/S0002-9939-1956-0078686-7 / rank
 
Normal rank
Property / author
 
Property / author: Joseph B. Kruskal / rank
 
Normal rank
Property / title
 
On the shortest spanning subtree of a graph and the traveling salesman problem (English)
Property / title: On the shortest spanning subtree of a graph and the traveling salesman problem (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 0070.18404 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 3117235 / rank
 
Normal rank
Property / zbMATH Keywords
 
topology
Property / zbMATH Keywords: topology / rank
 
Normal rank

Revision as of 12:20, 2 September 2023

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

    7
    0 references
    1
    0 references
    48-50
    0 references
    1956
    0 references
    0 references
    0 references
    On the shortest spanning subtree of a graph and the traveling salesman problem (English)
    0 references
    topology
    0 references

    Identifiers