Cutwidth II: Algorithms for partial w-trees of bounded degree (Q5462384)

From MaRDI portal
Revision as of 18:40, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2190432
Language Label Description Also known as
English
Cutwidth II: Algorithms for partial w-trees of bounded degree
scientific article; zbMATH DE number 2190432

    Statements

    Cutwidth II: Algorithms for partial w-trees of bounded degree (English)
    0 references
    0 references
    0 references
    0 references
    1 August 2005
    0 references
    0 references
    Cutwidth
    0 references
    Treewidth
    0 references
    Pathwidth
    0 references
    Graph layout
    0 references