Abstract
We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the robber is unknown to the cops, each cop can see a certain radius d around his position. For the case d = 1 these games have been studied by Fomin, Kratsch and Müller [7] under the name domination games.
We are primarily interested in questions concerning the complexity and monotonicity of these games. We show that dominating games are computationally much harder than standard graph searching games where the cops only see their own vertex and establish strong non-monotonicity results for various notions of monotonicity which arise naturally in the context of domination games. Answering a question of [7], we show that there exists graphs for which the shortest winning strategy for a minimal number of cops must necessarily be of exponential length. On the positive side, we establish tractability results for graph classes of bounded degree.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, I.: Marshals, monotone marshals, and hypertree-width. JGT 47(4), 275–296 (2004)
Adler, I., Gottlob, G., Grohe, M.: Hypertree width and related hypergraph invariants. Journal of Combinatorics 28(8), 2167–2181 (2007)
Bodlaender, H.: A partial k-aboretum of graphs with bounded tree-width. TCS 209, 1–45 (1998)
Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 19–36. Springer, Heidelberg (1997)
Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)
Fedor, F., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. TCS 399(3), 236–245 (2008)
Fomin, F., Kratsch, D., Müller, H.: On the domination search number. Discrete Applied Mathematics 127(3), 565–580 (2003)
Franklin, M.K., Galil, Z., Yung, M.: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. Journal of the ACM 47(2), 225–243 (2000)
Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and Systems Science 66(4), 775–808 (2003)
Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. TCS 47(3), 205–218 (1986)
Kloks, T., Kratsch, D., Müller, H.: On the structure of graphs with bounded asteroidal number. Graphs and Combinatorics 17(2), 295–306 (2001)
Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. Journal of Combinatorial Theory, Series B 58(1), 22–33 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kreutzer, S., Ordyniak, S. (2010). Distance d-Domination Games. In: Paul, C., Habib, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 2009. Lecture Notes in Computer Science, vol 5911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11409-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-11409-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11408-3
Online ISBN: 978-3-642-11409-0
eBook Packages: Computer ScienceComputer Science (R0)