𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stable matching problems with exchange restrictions

✍ Scribed by Robert W. Irving

Book ID
106407212
Publisher
Springer US
Year
2008
Tongue
English
Weight
320 KB
Volume
16
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The stable marriage problem with restric
The stable marriage problem with restricted pairs
✍ VΓ’nia M.F. Dias; Guilherme D. da Fonseca; Celina M.H. de Figueiredo; Jayme L. Sz πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 210 KB

A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other to their actual partners under the matching. In an instance of the STABLE MARRIAGE problem, each of the n men and n women ranks the members of the opposite sex in order of

Three-Dimensional Stabl Matching Problem
Three-Dimensional Stabl Matching Problems
✍ Ng, Cheng; Hirschberg, Daniel S. πŸ“‚ Article πŸ“… 1991 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 1013 KB
The exchange-stable marriage problem
The exchange-stable marriage problem
✍ KatarΓ­na CechlΓ‘rovΓ‘; David F. Manlove πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 217 KB
Some Queuing Problems with Restrictions
Some Queuing Problems with Restrictions
✍ Kovalenko, I. N. πŸ“‚ Article πŸ“… 1961 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 519 KB
Local maximum stable sets in bipartite g
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
✍ Vadim E. Levit; Eugen Mandrescu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 233 KB

A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ (G), if S is a maximum stable set of the subgraph spanned by S βˆͺ N (S), where N (S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce