Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537)

From MaRDI portal
Revision as of 17:44, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7651204
Language Label Description Also known as
English
Exploiting c-Closure in Kernelization Algorithms for Graph Problems
scientific article; zbMATH DE number 7651204

    Statements

    0 references
    0 references
    0 references
    7 February 2023
    0 references
    fixed-parameter tractability
    0 references
    kernelization
    0 references
    \(c\)-closure
    0 references
    dominating set
    0 references
    induced matching
    0 references
    irredundant set
    0 references
    Ramsey numbers
    0 references
    Exploiting c-Closure in Kernelization Algorithms for Graph Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers