Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661)

From MaRDI portal
Revision as of 11:32, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
scientific article

    Statements

    title
    Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (English)
    0 references
    author
    Marc Demange
    0 references
    Tınaz Ekim
    0 references
    publication date
    27 May 2008
    0 references
    zbMATH Keywords
    stable marriage
    0 references
    unmatched pairs
    0 references
    Minimum Maximal Matching
    0 references
    regular bipartite graphs
    0 references

    Identifiers

    zbMATH DE Number
    5279208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3502661&oldid=27832293"
    Powered by MediaWiki