Rotations in the stable b-matching problem

Authors:
Viera Borbelová;Katarína Cechlárová
Affiliations:
Institute of Mathematics, Faculty of Science, P.J. afárik University, Jesenná 5, 041 54 Koice, Slovakia;Institute of Mathematics, Faculty of Science, P.J. afárik University, Jesenná 5, 041 54 Koice, Slovakia
Venue:
Theoretical Computer Science
Year:
2010

Citing 12
Cited 0

The structure of the stable roomate problem: efficient representation and enumeration of all stable assignments

SIAM Journal on Computing
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
A necessary and sufficient condition for the existence of a complete stable matching

Journal of Algorithms
A new fixed point approach for stable networks and stable marriages

Journal of Computer and System Sciences
A generalization of the stable matching problem

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The stable crews problem

Discrete Applied Mathematics
On a generalization of the stable roommates problem

ACM Transactions on Algorithms (TALG)
Polynomial time algorithm for an optimal stable assignment with multiple partners

Theoretical Computer Science
The stable fixtures problem-A many-to-many extension of stable roommates

Discrete Applied Mathematics
On the stable b-matching problem in multigraphs

Discrete Applied Mathematics
A unified approach to finding good stable matchings in the hospitals/residents setting

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper deals with the stable b-matching problem on general multigraphs. We generalize the notion of singular and dual rotations and establish a one-one correspondence between stable b-matchings and certain sets of rotations. This correspondence is used to find all stable edges and a minimum regret stable b-matching in polynomial time. We also recall the NP-completeness of the egalitarian stable b-matching problem.