1 paper
Linda Farczadi, Natália Guričanová
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching…