en / hu

Cseh Ágnes és Telikepalli Kavitha Popular Matchings in Complete Graphs című tanulmánya megjelent az Algorithmica szakfolyóiratban

Published: 25 January 2021

Cseh, Á., Kavitha, T. : Popular Matchings in Complete Graphs. Algorithmica (2021).

An instance that admits two popular matchings—marked by dotted blue and dashed orange edges—but no stable matching. The preference list of each vertex is illustrated by the numbers on its edges: a lower number indicates a more preferred neighbor (Color figure online)