NP-completeness of minimal width unordered tree layout.
Marriott, Kim ; Stuckey, Peter J.
Journal of Graph Algorithms and Applications, Tome 8 (2004), p. 295-312 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:52392 
@article{05016883,
     title = {NP-completeness of minimal width unordered tree layout.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {8},
     year = {2004},
     pages = {295-312},
     zbl = {1088.68070},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05016883}
}

Marriott, Kim; Stuckey, Peter J. NP-completeness of minimal width unordered tree layout.. Journal of Graph Algorithms and Applications, Tome 8 (2004) pp. 295-312. http://gdmltest.u-ga.fr/item/05016883/