2 papers
cs.LO2026
Introducing The Maximum Common Bigraph Problem
Kyle Burns, Michele Sevegnani, Ciaran McCreesh +1
Bigraph reactive systems offer a powerful and flexible mathematical framework for modelling both spatial and non-spatial relationships between agents, with practical applications i…
cs.DS2024
Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
Gergely Csáji, David Manlove, Iain McBride +1
In this paper, we study the Hospitals / Residents problem with Couples (HRC), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time…