94 citations · 133 across the 14 of their papers we have counts for
1 paper · 1 filter
A. Grinshpun, P. Phalitnonkiat, S. Rubin +1
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is…