A characterization of graphs that ensure the existence of stable matchings (Q1181746): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:56, 30 January 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
