Planar embeddability of the vertices of a graph using a fixed point set is NP-hard

Sergio Cabello Justo
Proc. 20th Eur. Worksh. Computational Geometry, Mar 2004
Tech. report UU-CS-2003-031, Univ. Utrecht, Dept. of Computer Science, 2003
http://www.cs.uu.nl/research/techreps/UU-CS-2003-031.html
http://www.us.es/ewcg04/Articulos/cabello.ps

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!