The parameterized complexity of the induced matching problem (Q1028465): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 22:17, 30 January 2024

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