Pakawat Phalitnonkiat

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 to compute the winning regions for the players. Different classes and representations of Muller games lead to problems of varying computational complexity. One such class are(More)
  • 1