Generalised stable partitions characterize the solution space of many-to-many non-bipartite stable matching, giving a solvability certificate and improved near-feasible algorithms.
Manipulating the outcome of stable marriage and roommates problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
Generalised stable partitions characterize the solution space of many-to-many non-bipartite stable matching, giving a solvability certificate and improved near-feasible algorithms.