The parameterized complexity of the induced matching problem (Q1028465)

From MaRDI portal
Revision as of 08:27, 11 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    induced matching
    0 references
    parameterized complexity
    0 references
    planar graph
    0 references
    kernelization
    0 references
    tree decomposition
    0 references

    Identifiers