Every finite distributive lattice is a set of stable matchings for a small stable marriage instance-Reference-Cited by-同舟云学术

Every finite distributive lattice is a set of stable matchings for a small stable marriage instance

Published:1987-03 Issue:2 Volume:44 Page:304-309
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Gusfield Dan,Irving Robert,Leather Paul,Saks Michael

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference9 articles.

1. Lattice Theory;Birkhoff,1967

2. Every finite distributive lattice is a set of stable matchings;Blair;J. Combin. Theory, Ser. A,1984

3. Lattice Theory;Gratzer,1971

4. Three Fast Algorithms for Four Problems in Stable Marriage;Gusfield;Yale University Computer Science Technical Report No. 407,1985

5. The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments;Gusfield;Yale University Computer Science Technical Report No. 482,1986

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences;Discrete Applied Mathematics;2023-07

2. Marriage and Roommate;International Journal of Foundations of Computer Science;2023-06-30

3. Review of the Theory of Stable Matchings and Contract Systems;Computational Mathematics and Mathematical Physics;2023-03

4. Review of the Theory of Stable Matchings and Contract Systems;Журнал вычислительной математики и математической физики;2023-03-01

5. Counterexamples of Small Size for Three-Sided Stable Matching with Cyclic Preferences;Russian Mathematics;2022-06