Rotations in the stable \(b\)-matching problem

DOI10.1016/j.tcs.2010.01.017zbMath1192.68472OpenAlexW2070908074MaRDI QIDQ964393

Viera Borbel'ová, Katarína Cechlárova

Publication date: 15 April 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.017

zbMATH Keywords

egalitarianminimum regretrotation posetstable \(b\)-matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• A unified approach to finding good stable matchings in the hospitals/residents setting
• A new fixed point approach for stable networks and stable marriages
• A generalization of the stable matching problem
• The stable crews problem
• Polynomial time algorithm for an optimal stable assignment with multiple partners
• The stable fixtures problem -- a many-to-many extension of stable roommates
• On the stable \(b\)-matching problem in multigraphs
• The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
• On a generalization of the stable roommates problem
• A necessary and sufficient condition for the existence of a complete stable matching
• An efficient algorithm for the “stable roommates” problem
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• College Admissions and the Stability of Marriage

This page was built for publication: Rotations in the stable \(b\)-matching problem