Strongly stable and maximum weakly stable noncrossing matchings
From MaRDI portal
Publication:1979449
DOI10.1007/S00453-021-00832-9OpenAlexW3045006921MaRDI QIDQ1979449FDOQ1979449
Authors: Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto 
Publication date: 2 September 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.08468
Recommendations
Cites Work
- Title not available (Why is that?)
- Some remarks on the stable matching problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- College Admissions and the Stability of Marriage
- Size versus stability in the marriage problem
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- ``Almost stable matchings in the roommates problem with bounded preference lists
- Strongly stable and maximum weakly stable noncrossing matchings
- Stable marriage and indifference
- Title not available (Why is that?)
- Stable marriage with ties and bounded length preference lists
- Stable noncrossing matchings
- Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
- A matching problem in the plane
- Efficient labelling algorithms for the maximum noncrossing matching problem
- Computing maximum non-crossing matching in convex bipartite graphs
- Jointly stable matchings
Cited In (4)
This page was built for publication: Strongly stable and maximum weakly stable noncrossing matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979449)
