On the stable \(b\)-matching problem in multigraphs
From MaRDI portal
Publication:2476254
DOI10.1016/j.dam.2007.08.023zbMath1132.91577OpenAlexW2031198302MaRDI QIDQ2476254
Viera Borbel'ová, Katarína Cechlárova
Publication date: 18 March 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.023
Related Items (2)
Dynamics in matching and coalition formation games with structural constraints ⋮ Rotations in the stable \(b\)-matching problem
Cites Work
- Unnamed Item
- The stable crews problem
- The stable fixtures problem -- a many-to-many extension of stable roommates
- On a generalization of the stable roommates problem
- The Stable Roommates Problem with Ties
- Lower Bounds for the Stable Marriage Problem and Its Variants
- An efficient algorithm for the “stable roommates” problem
- The Complexity of Counting Stable Marriages
- College Admissions and the Stability of Marriage
This page was built for publication: On the stable \(b\)-matching problem in multigraphs