1 paper
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…