2 papers
cs.DS2024
Perfect Matchings and Popularity in the Many-to-Many Setting
Telikepalli Kavitha, Kazuhisa Makino
We consider a matching problem in a bipartite graph where every vertex has a capacity and a strict preference order on its neighbors. Furthermore, there is a cost function on t…
cs.DS2023
Arborescences, Colorful Forests, and Popularity
Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter +1
Our input is a directed, rooted graph where each vertex in has a partial order preference over its incoming edges. The preferences of a vertex extend nat…