Sciweavers

JGAA
2006
108views more  JGAA 2006»
14 years 13 days ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello