Every finite distributive lattice is a set of stable...

Journal of Combinatorial Theory, Series A 1987 Vol. 44; Iss. 2

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

Dan Gusfield, Robert Irving, Paul Leather, Michael Saks
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
44
Year:
1987
Language:
english
Pages:
6
DOI:
10.1016/0097-3165(87)90037-9
File:
PDF, 311 KB
english, 1987
Conversion to is in progress
Conversion to is failed