A maximum stable matching for the roommates problem (Q922705): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: College Admissions and the Stability of Marriage / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments / 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: A necessary and sufficient condition for the existence of a complete stable matching / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01933211 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1968154277 / rank | |||
Normal rank |
Latest revision as of 11:37, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A maximum stable matching for the roommates problem |
scientific article |
Statements
A maximum stable matching for the roommates problem (English)
0 references
1990
0 references
stable roommates problem
0 references
stable matching
0 references
maximum stable matching
0 references
0 references