A characterization of graphs that ensure the existence of stable matchings (Q1181746)

From MaRDI portal
Revision as of 14:30, 15 May 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
A characterization of graphs that ensure the existence of stable matchings
scientific article

    Statements

    title
    A characterization of graphs that ensure the existence of stable matchings (English)
    0 references
    author
    Garth Isaak
    0 references
    Hernán G. Abeledo
    0 references
    publication date
    27 June 1992
    0 references
    zbMATH DE Number
    28757
    0 references
    zbMATH Keywords
    stable marriage
    0 references
    bipartite acceptability graph
    0 references
    stable matching
    0 references
    OpenAlex ID
    W2038401741
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1181746&oldid=34082383"
    Powered by MediaWiki