Mathieu Hilaire

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
We define and study the following two-player game on a graph G. Let k ∈ N *. A set of k guards is occupying some vertices of G while one spy is standing at some node. At each turn, first the spy may move along at most s edges, where s ∈ N * is his speed. Then, each guard may move along one edge. The spy and the guards may occupy same vertices. The spy has(More)
  • 1