On the shortest spanning subtree of a graph and the traveling salesman problem (Q115238): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Removed claim: DOI (P27): 10.1090/S0002-9939-1956-0078686-7 |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1090/s0002-9939-1956-0078686-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965680834 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 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
