A characterization of graphs that ensure the existence of stable matchings (Q1181746): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| 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 | |||
Revision as of 00:01, 20 March 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
