A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5892184)

From MaRDI portal
Revision as of 01:14, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6485164
Language Label Description Also known as
English
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
scientific article; zbMATH DE number 6485164

    Statements

    A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 September 2015
    0 references
    iterative compression
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    hereditary graph properties
    0 references
    parameterized complexity
    0 references
    vertex deletion problems
    0 references

    Identifiers

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