Resolves all open complexity cases for stable marriage existence under ties plus forced/forbidden/free edges for weak/strong/super-stability, and proves NP-hardness of max weakly stable matching in dense graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The stable marriage problem with ties and restricted edges
Resolves all open complexity cases for stable marriage existence under ties plus forced/forbidden/free edges for weak/strong/super-stability, and proves NP-hardness of max weakly stable matching in dense graphs.