We examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zero-visibility copnumber in terms of the pathwidth.
Authors
- prof. dr hab. inż. Dariusz Dereniowski link open in new tab ,
- Danny Dyer,
- Ryan M. Tifenbach,
- Boting Yang
Additional information
- DOI
- Digital Object Identifier link open in new tab 10.1007/978-3-642-38756-2_19
- Category
- Publikacja w czasopiśmie
- Type
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Language
- angielski
- Publication year
- 2013
Source: MOSTWiedzy.pl - publication "Zero-Visibility Cops and Robber Game on a Graph" link open in new tab
