Strongly stable and maximum weakly stable noncrossing matchings

DOI10.1007/s00453-021-00832-9OpenAlexW3045006921MaRDI QIDQ1979449

Kazuya Okamoto, Koki Hamada, Shuichi Miyazaki

Publication date: 2 September 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.08468

zbMATH Keywords

NP-completenesspolynomial-time algorithmsstable marriagenoncrossing matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Algorithms and complexity of strongly stable non-crossing matchings

Cites Work

• ``Almost stable matchings in the roommates problem with bounded preference lists
• Size versus stability in the marriage problem
• Stable marriage with ties and bounded length preference lists
• A matching problem in the plane
• Some remarks on the stable matching problem
• Efficient labelling algorithms for the maximum noncrossing matching problem
• Stable marriage and indifference
• Stable noncrossing matchings
• Computing maximum non-crossing matching in convex bipartite graphs
• Jointly stable matchings
• Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
• Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
• Algorithmics of Matching Under Preferences
• The complexity of theorem-proving procedures
• College Admissions and the Stability of Marriage
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly stable and maximum weakly stable noncrossing matchings