NP-completeness of the planar separator problems.
Journal of Graph Algorithms and Applications (2006)
- Volume: 10, Issue: 2, page 317-328
- ISSN: 1526-1719
Access Full Article
top
How to cite
topFukuyama, Junichiro. "NP-completeness of the planar separator problems.." Journal of Graph Algorithms and Applications 10.2 (2006): 317-328. <http://eudml.org/doc/45389>.
@article{Fukuyama2006,
author = {Fukuyama, Junichiro},
journal = {Journal of Graph Algorithms and Applications},
keywords = {Vertex Separator Problem; Edge Separator Problem; unweighted graphs; Planar Separator Problem},
language = {eng},
number = {2},
pages = {317-328},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {NP-completeness of the planar separator problems.},
url = {http://eudml.org/doc/45389},
volume = {10},
year = {2006},
}
TY - JOUR
AU - Fukuyama, Junichiro
TI - NP-completeness of the planar separator problems.
JO - Journal of Graph Algorithms and Applications
PY - 2006
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 10
IS - 2
SP - 317
EP - 328
LA - eng
KW - Vertex Separator Problem; Edge Separator Problem; unweighted graphs; Planar Separator Problem
UR - http://eudml.org/doc/45389
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.