Results

1 - 2 of 2
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]
The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ in a game in which the cops always know the location of the robber, and the cops and robber move alternately along edges of a reflexive graph. The cops capture the robber if one of them occupies the same vertex as ...