A characterization of graphs that ensure the existence of stable matchings (Q1181746): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0165-4896(91)90069-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038401741 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonexistence of stable threesome matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: College Admissions and the Stability of Marriage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995616 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4130997 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273943 / rank | |||
Normal rank |
Latest revision as of 14:30, 15 May 2024
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
27 June 1992
0 references
stable marriage
0 references
bipartite acceptability graph
0 references
stable matching
0 references