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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, M., Räcke, H., Sivadasan, N., Sohler, C., Vöcking, B.: Randomized pursuit-evasion in graphs. Combinatorics, Probability and Computing 12, 225–244 (2003)
Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms 12, 239–245 (1991)
Clarke, N.E., MacGillivray, G.: Characterizations of k-copwin graphs. Discrete Mathematics 312, 1421–1425 (2012)
Dereniowski, D.: From pathwidth to connected pathwidth. SIAM Journal on Discrete Mathematics 26, 1709–1732 (2012)
Dereniowski, D., Dyer, D., Tifenbach, R., Yang, B.: The zero-visibility copnumber of a tree (2013)
Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)
Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Information and Computing 113, 50–79 (1994)
Isler, V., Kannan, S., Khanna, S.: Randomized pursuit-evasion with local visibility. SIAM Journal on Discrete Mathematics 20, 26–41 (2006)
Isler, V., Karnad, N.: The role of information in the cop-robber game. Theoretical Computer Science 399, 179–190 (2008)
Jeliazkova, D.: Aspects of the cops and robber game played with incomplete information. Master’s thesis, Acadia University (2006)
Kehagias, A., Mitche, D., Prałat, P.: The role of visibility in the cops-robber game and robotic pursuit/evasion (2012)
Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Information Processing Letters 42, 345–350 (1992)
LaPaugh, A.S.: Recontamination does not help to search a graph. Journal of the ACM 40, 224–245 (1993)
Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43, 235–239 (1983)
Quilliot, A.: Problèmes de jeux, de point fixe, de connectivité et de représentation sur des graphes, des ensembles ordonnés et des hypergraphes. PhD thesis, Université de Paris VI (1983)
Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B 35, 39–61 (1983)
Tang, A.: Cops and robber with bounded visibility. Master’s thesis, Dalhousie University (2004)
Tošić, R.: Inductive classes of graphs. In: Proceedings of the Sixth Yugoslav Seminar on Graph Theory, pp. 233–237. University of Novi Sad (1985)
Yang, B.: Strong-mixed searching and pathwidth. Journal of Combinatorial Optimization 13, 47–59 (2007)
Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 908–920. Springer, Heidelberg (2004)
Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. Discrete Mathematics 309, 5770–5780 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B. (2013). Zero-Visibility Cops and Robber Game on a Graph. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)