Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316)

From MaRDI portal
Revision as of 00:33, 8 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
scientific article

    Statements

    Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (English)
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    dynamic programming
    0 references
    tree-decomposition
    0 references
    branch-decomposition
    0 references
    path-decomposition
    0 references
    dominating set
    0 references
    brachwidth
    0 references
    treewidth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references