Title of article
The stable fixtures problem—A many-to-many extension of stable roommates Original Research Article
Author/Authors
Robert W. Irving، نويسنده , , Sandy Scott، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
12
From page
2118
To page
2129
Abstract
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time algorithm that determines whether a stable matching exists, and if so, returns one such matching.
Keywords
Many-to-many non-bipartite matching , Stable matching problem , Linear-time algorithm
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886576
Link To Document