1 citations · 1 across the 16 of their papers we have counts for
1 paper · 1 filter
Ildikó Schlotter, Ágnes Cseh
In a graph where vertices have preferences over their neighbors, a matching is called popular if it does not lose a head-to-head election against any other matching when the vertic…