On the NP-completeness of the perfect matching free subgraph problem (Q418003)

From MaRDI portal
Revision as of 05:44, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the NP-completeness of the perfect matching free subgraph problem
scientific article

    Statements

    title
    On the NP-completeness of the perfect matching free subgraph problem (English)
    0 references
    author
    Mathieu Lacroix
    0 references
    Sébastien Martin
    0 references
    Christophe Picouleau
    0 references
    Ali Ridha Mahjoub
    0 references
    publication date
    14 May 2012
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C85
    0 references
    05C70
    0 references
    zbMATH DE Number
    6034857
    0 references
    zbMATH Keywords
    bipartite graph
    0 references
    matching
    0 references
    blocker
    0 references
    stable set
    0 references
    tripartite graph
    0 references
    NP-complete
    0 references
    structural analysis problem
    0 references
    OpenAlex ID
    W2157200475
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q418003&oldid=35278653"
    Powered by MediaWiki