NP-completeness of minimal width unordered tree layout

Kimbal George Marriott, Peter J Stuckey

    Research output: Contribution to journalArticleResearchpeer-review

    6 Citations (Scopus)
    Original languageEnglish
    Pages (from-to)295 - 312
    Number of pages18
    JournalJournal of Graph Algorithms and Applications
    Volume8
    Issue number3
    Publication statusPublished - 2004

    Cite this

    @article{8cfab843f0e940cfb4a33502d8720602,
    title = "NP-completeness of minimal width unordered tree layout",
    author = "Marriott, {Kimbal George} and Stuckey, {Peter J}",
    year = "2004",
    language = "English",
    volume = "8",
    pages = "295 -- 312",
    journal = "Journal of Graph Algorithms and Applications",
    issn = "1526-1719",
    number = "3",

    }

    NP-completeness of minimal width unordered tree layout. / Marriott, Kimbal George; Stuckey, Peter J.

    In: Journal of Graph Algorithms and Applications, Vol. 8, No. 3, 2004, p. 295 - 312.

    Research output: Contribution to journalArticleResearchpeer-review

    TY - JOUR

    T1 - NP-completeness of minimal width unordered tree layout

    AU - Marriott, Kimbal George

    AU - Stuckey, Peter J

    PY - 2004

    Y1 - 2004

    M3 - Article

    VL - 8

    SP - 295

    EP - 312

    JO - Journal of Graph Algorithms and Applications

    JF - Journal of Graph Algorithms and Applications

    SN - 1526-1719

    IS - 3

    ER -