The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (Q3612599)

From MaRDI portal
Revision as of 13:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
scientific article

    Statements

    title
    The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (English)
    0 references
    author
    Hannes Moser
    0 references
    Somnath Sikdar
    0 references
    publication date
    10 March 2009
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    5527348
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3612599&oldid=27922418"
    Powered by MediaWiki