Stable noncrossing matchings

DOI10.1007/978-3-030-25005-8_33MaRDI QIDQ2301760zbMATH OpenOpenAlexFDO

Authors Suthee Ruangwises, Toshiya Itoh

Publication date 25 February 2020

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

zbMATH Keywords

geometric matchingnoncrossing matchingStable Marriage problemstable matching

Mathematics Subject Classification ID

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

Recommendations

• Strongly stable and maximum weakly stable noncrossing matchings
• Strongly stable and maximum weakly stable noncrossing matchings
• The stable marriage problem with restricted pairs.
• An efficient algorithm for the “stable roommates” problem
• Stable marriage and indifference

Cited in

(9)

• Strongly stable and maximum weakly stable noncrossing matchings
• Maximum weighted matching with few edge crossings for 2-layered bipartite graph
• Strongly stable and maximum weakly stable noncrossing matchings
• Algorithms and complexity of strongly stable non-crossing matchings
• Unique stable matchings
• Algorithms and complexity of strongly stable non-crossing matchings
• On the online weighted non-crossing matching problem
• On the online weighted non-crossing matching problem
• New variants of perfect non-crossing matchings

This page was built for publication: Stable noncrossing matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301760)