Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- 1 March 1987
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 44 (2) , 304-309
- https://doi.org/10.1016/0097-3165(87)90037-9
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Complexity of Counting Stable MarriagesSIAM Journal on Computing, 1986
- Every finite distributive lattice is a set of stable matchingsJournal of Combinatorial Theory, Series A, 1984
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962