On the shortest spanning subtree of a graph and the traveling salesman problem (Q55933607)
Jump to navigation
Jump to search
No description defined
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
Language | Label | Description | Also known as |
---|---|---|---|
English | On the shortest spanning subtree of a graph and the traveling salesman problem |
No description defined |
|
Statements
On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem (English)
0 references
February 1956
0 references
7
0 references
1
0 references
48-48
0 references