Three Fast Algorithms for Four Problems in Stable Marriage
- 1 February 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (1) , 111-128
- https://doi.org/10.1137/0216010
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Complexity of Counting Stable MarriagesSIAM Journal on Computing, 1986
- Some remarks on the stable matching problemDiscrete Applied Mathematics, 1985
- The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game TheoryJournal of Political Economy, 1984
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977
- A structured program to generate all topological sorting arrangementsInformation Processing Letters, 1974
- The stable marriage problemCommunications of the ACM, 1971
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962