Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866)

From MaRDI portal
Revision as of 06:44, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
scientific article

    Statements

    Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (English)
    0 references
    0 references
    14 January 2010
    0 references
    \(H\)-minor-free graphs
    0 references
    degenerated graphs
    0 references
    dominating set problem
    0 references
    fixed-parameter tractable algorithms
    0 references
    problem kernel
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references