The parameterized complexity of the induced matching problem (Q1028465)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The parameterized complexity of the induced matching problem
scientific article

    Statements

    The parameterized complexity of the induced matching problem (English)
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    induced matching
    0 references
    parameterized complexity
    0 references
    planar graph
    0 references
    kernelization
    0 references
    tree decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references