The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The realization problem for Euclidean minimum spanning trees is NP-hard |
scientific article |
Statements
The realization problem for Euclidean minimum spanning trees is NP-hard (English)
0 references
10 November 1996
0 references
Euclidean minimum spanning tree
0 references
NP-hard
0 references
