On the shortest spanning subtree of a graph and the traveling salesman problem (Q115238): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55933607, #quickstatements; #temporary_batch_1706897434465 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:03, 3 February 2024
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
