NP-completeness of minimal width unordered tree layout.
Marriott, Kim; Stuckey, Peter J.
Journal of Graph Algorithms and Applications (2004)
- Volume: 8, Issue: 3, page 295-312
- ISSN: 1526-1719
Access Full Article
top
How to cite
topMarriott, Kim, and Stuckey, Peter J.. "NP-completeness of minimal width unordered tree layout.." Journal of Graph Algorithms and Applications 8.3 (2004): 295-312. <http://eudml.org/doc/52392>.
@article{Marriott2004,
author = {Marriott, Kim, Stuckey, Peter J.},
journal = {Journal of Graph Algorithms and Applications},
keywords = {binary rooted trees},
language = {eng},
number = {3},
pages = {295-312},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {NP-completeness of minimal width unordered tree layout.},
url = {http://eudml.org/doc/52392},
volume = {8},
year = {2004},
}
TY - JOUR
AU - Marriott, Kim
AU - Stuckey, Peter J.
TI - NP-completeness of minimal width unordered tree layout.
JO - Journal of Graph Algorithms and Applications
PY - 2004
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 8
IS - 3
SP - 295
EP - 312
LA - eng
KW - binary rooted trees
UR - http://eudml.org/doc/52392
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.