ISSN:
1432-0541
Keywords:
Tree
;
Algorithm
;
Graph drawing
;
NP-hard
;
Spanning tree
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We show that the problem of determining whether a tree can be drawn so that it is the Euclidean minimum spanning tree of the locations of its vertices is NP-hard.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02086608
Permalink