On the shortest spanning subtree of a graph and the traveling salesman problem (Q115238)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the shortest spanning subtree of a graph and the traveling salesman problem |
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
On the shortest spanning subtree of a graph and the traveling salesman problem (English)
0 references
topology
0 references