Abstract
In this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
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
Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms 12, 239–245 (1991)
Bonato, A., Nowakowski, R.: The Game of Cops and Robbers on Graphs. Student Mathematical Library, vol. 61. American Mathematical Society (2011)
Clarke, N.E., MacGillivray, G.: Characterizations of k-copwin graphs. Discrete Mathematics 312, 1421–1425 (2012)
Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B.: Zero-visibility cops and robber game on a graph. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 175–186. Springer, Heidelberg (2013)
Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B.: Zero-visibility cops & robber and the pathwidth of a graph. Journal of Combinatorial Optimization (2014)
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)
Fomin, F.V., Heggernes, P., Mihai, R.: Mixed search number and linear-width of interval and split graphs. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 304–315. Springer, Heidelberg (2007)
Gustedt, J.: On the pathwidth of chordal graphs. Discrete Applied Mathematics 45, 233–248 (1993)
Jeliazkova, D.: Aspects of the cops and robber game played with incomplete information. Master’s thesis, Acadia University (2006)
Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Information Processing Letters 42, 345–350 (1992)
Kinnersley, W.B.: Cops and robbers is EXPTIME -complete. arXiv.1309.5405 [math.CO] (2013)
Megiddo, N., Hakimi, S.L., Garey, M., Johnson, D., Papadimitriou, C.H.: The complexity of searching a graph. Journal of the ACM 35, 18–44 (1988)
Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43, 235–239 (1983)
Parsons, T.: Pursuit-evasion in a graph. In: Proceedings of the International Conference on the Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 426–441. Springer (1978)
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)
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)
West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson (2000)
Yang, B., Zhang, R., Cao, Y.: Searching cycle-disjoint graphs. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 32–43. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Dereniowski, D., Dyer, D., Tifenbach, R.M., Yang, B. (2014). The Complexity of Zero-Visibility Cops and Robber. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)