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

From MaRDI portal
Publication:1821125

DOI10.1016/0097-3165(87)90037-9zbMath0616.06009OpenAlexW2003618558MaRDI QIDQ1821125

Paul Leather, Robert W. Irving, Dan Gusfield, Michael E. Saks

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90037-9



Related Items



Cites Work