Abstract
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. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Dereniowski, D., Dyer, D., Tifenbach, R. M., & Yang, B. (2013). Zero-visibility cops and robber game on a graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7924 LNCS, pp. 175–186). https://doi.org/10.1007/978-3-642-38756-2_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
