Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices
Publication:3012842
DOI10.1007/978-3-642-22006-7_57zbMath1334.05114OpenAlexW2143520050MaRDI QIDQ3012842
Ichiro Suzuki, Christine T. Cheng, Eric J. McDermid
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_57
Analysis of algorithms and problem complexity (68Q25) Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structure and representation theory of distributive lattices (06D05) Matching models (91B68)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Every finite distributive lattice is a set of stable matchings
- Distance center and centroid of a median graph
- Generating random elements of finite distributive lattices
- Lattice structures from planar graphs
- Understanding the generalized median stable matchings
- The Geometry of Fractional Stable Matchings and Its Applications
- The Complexity of Approximately Counting Stable Matchings
- Three Fast Algorithms for Four Problems in Stable Marriage
- College Admissions and the Stability of Marriage
This page was built for publication: Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices