New upper bounds on the decomposability of planar graphs (Q3376690)

From MaRDI portal
Revision as of 12:26, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New upper bounds on the decomposability of planar graphs
scientific article

    Statements

    New upper bounds on the decomposability of planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    tree-width
    0 references
    branch-width
    0 references
    separation theorems
    0 references
    parameterized algorithms
    0 references
    subexponential algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references