On two techniques of combining branching and treewidth (Q1022343)

From MaRDI portal
Revision as of 16:14, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
On two techniques of combining branching and treewidth
scientific article

    Statements

    On two techniques of combining branching and treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2009
    0 references
    exact exponential time algorithms
    0 references
    parameterized algorithms
    0 references
    NP hard problems
    0 references
    treewidth
    0 references
    \#3-Coloring
    0 references
    \#minimum dominating set
    0 references
    minimum maximal matching
    0 references
    \(k\)-Weighted vertex cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers