Cops and Robber Game with a Fast Robber
Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to se...
Main Author: | Mehrabian, Abbas |
---|---|
Language: | en |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/5821 |
Similar Items
-
Cops and Robber Game with a Fast Robber
by: Mehrabian, Abbas
Published: (2011) -
Lazy Cops and Robber on Certain Cayley Graph
by: Sim, K.A, et al.
Published: (2022) -
Catching an infinitely fast robber on a grid
by: Kinnersley, W.B, et al.
Published: (2022) -
A Cop and Drunken Robber Game on <i>n</i>-Dimensional Infinite-Grid Graphs
by: Nuttanon Songsuwan, et al.
Published: (2021-08-01) -
On Meyniel's conjecture and the Zig-Zag Theorem : Cops and robbers on random graphs
by: Nygren, Clara
Published: (2020)