Strongly Stable and Maximum Weakly Stable Noncrossing Matchings

DOI10.1007/978-3-030-48966-3_23OpenAlexW3028795138MaRDI QIDQ5041200

Shuichi Miyazaki, Koki Hamada, Kazuya Okamoto

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_23

zbMATH Keywords

NP-completenesspolynomial-time algorithmsstable marriagenoncrossing matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Algorithms and complexity of strongly stable non-crossing matchings ⋮ Strongly stable and maximum weakly stable noncrossing matchings

Cites Work

• Some remarks on the stable matching problem
• Stable marriage and indifference
• Stable noncrossing matchings
• Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
• 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