Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.
Journal of Graph Algorithms and Applications (2006)
- Volume: 10, Issue: 2, page 353-363
- ISSN: 1526-1719
Access Full Article
top
How to cite
topCabello, Sergio. "Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.." Journal of Graph Algorithms and Applications 10.2 (2006): 353-363. <http://eudml.org/doc/55397>.
@article{Cabello2006,
author = {Cabello, Sergio},
journal = {Journal of Graph Algorithms and Applications},
language = {eng},
number = {2},
pages = {353-363},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.},
url = {http://eudml.org/doc/55397},
volume = {10},
year = {2006},
}
TY - JOUR
AU - Cabello, Sergio
TI - Planar embeddability of the vertices of a graph using a fixed point set is NP-hard.
JO - Journal of Graph Algorithms and Applications
PY - 2006
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 10
IS - 2
SP - 353
EP - 363
LA - eng
UR - http://eudml.org/doc/55397
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.