The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (4) , 742-769
- https://doi.org/10.1137/0217048
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An efficient algorithm for the “stable roommates” problemPublished by Elsevier ,2004
- An efficient algorithm for the “optimal” stable marriageJournal of the ACM, 1987
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instanceJournal of Combinatorial Theory, Series A, 1987
- Three Fast Algorithms for Four Problems in Stable MarriageSIAM Journal on Computing, 1987
- The Complexity of Counting Stable MarriagesSIAM Journal on Computing, 1986
- Some remarks on the stable matching problemDiscrete Applied Mathematics, 1985
- Structural Theory for the Combinatorial Systems Characterized by Submodular FunctionsPublished by Elsevier ,1984
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time AlgorithmsSIAM Journal on Computing, 1980
- The stable marriage problemCommunications of the ACM, 1971
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962