The realization problem for Euclidean minimum spanning trees is NP-hard

Authors:
Peter Eades;Sue Whitesides
Affiliations:
Department of Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia;School of Computer Science, McGill University, 3480 University St., #318, Montreal, Quebec H3A 2A7, Canada
Venue:
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Year:
1994

Citing 4
Cited 6

Transitions in geometric minimum spanning trees (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A linear-time algorithm for testing the inscribability of trivalent polyhedra

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Simple Method for Resolving Degeneracies in Delaunay Triangulations

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming

Voronoi drawings of trees

Computational Geometry: Theory and Applications
Maximum Weight Triangulation and Its Application on Graph Drawing

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Proximity Drawings: Three Dimensions Are Better than Two

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Triangulations without Minimum-Weight Drawing

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
On embedding an outer-planar graph in a point set

Computational Geometry: Theory and Applications
Visualisation of satisfiability using the logic engine

APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that deciding whether a tree can be drawn in the plane so that it is the Euclidean minimum spanning tree of the locations of its vertices is NP-hard.