NP-complete stable matching problems
- 1 June 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (2) , 285-304
- https://doi.org/10.1016/0196-6774(90)90007-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An efficient algorithm for the “stable roommates” problemPublished by Elsevier ,2004
- The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game TheoryJournal of Political Economy, 1984
- The Upper Bound for the Stable Marriage ProblemJournal of the Operational Research Society, 1978
- An analysis of the stable marriage assignment algorithmBIT Numerical Mathematics, 1972
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962