Parameterized complexity of vertex deletion into perfect graph classes (Q392038)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized complexity of vertex deletion into perfect graph classes
scientific article

    Statements

    Parameterized complexity of vertex deletion into perfect graph classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterized complexity
    0 references
    perfect graphs
    0 references
    vertex deletion problems
    0 references
    kernelization
    0 references
    0 references