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

From MaRDI portal
Revision as of 00:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A characterization of graphs that ensure the existence of stable matchings
scientific article

    Statements

    A characterization of graphs that ensure the existence of stable matchings (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    0 references
    stable marriage
    0 references
    bipartite acceptability graph
    0 references
    stable matching
    0 references