3 papers
cs.DS2026
Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
Christine T. Cheng, Will Rosenbaum
In the Stable Roommates Problem (SR), a set of agents rank one another in a linear order. The goal is to find a matching that is stable: one that has no pair of agents who mut…
math.CO2025
Breaking the Symmetries of Amenable Graphs
Christine T. Cheng
In this paper, we consider two ways of breaking a graph's symmetry: distinguishing labelings and fixing sets. A distinguishing labeling of colors the vertices of so th…
math.CO2024
The Pinnacle Sets of a Graph
Chassidy Bozeman, Christine Cheng, Pamela E. Harris +2
We introduce and study the pinnacle sets of a simple graph with vertices. Given a bijective vertex labeling , the label of vertex is…