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

  • Authors:
  • Dan Gusfield;Robert Irving;Paul Leather;Michael Saks

  • Affiliations:
  • Yale Univ., New Haven, CT;Univ. of Glasgow, Glasgow, Scotland;Salford College of Technology, Salford, UK;Bell Communications Research, Morristown, NJ

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract