Abstract
In the (s, d)-spy game over a graph G, k guards and one spy occupy some vertices of G and, at each turn, the spy may move with speed s (along at most s edges) and each guard may move along one edge. The spy and the guards may occupy the same vertices. The spy wins if she reaches a vertex at distance more than the surveilling distance d from every guard. This game was introduced by Cohen et al. in 2016 and is related to two well-studied games: Cops and robber game and Eternal Dominating game. The guard number \(gn_{s,d}(G)\) is the minimum number of guards such that the guards have a winning strategy (of controlling the spy) in the graph G. In 2018, it was proved that deciding if the spy has a winning strategy is NP-hard for every speed \(s\ge 2\) and distance \(d\ge 0\). In this paper, we initiate the investigation of the guard number in grids and in graph products. We obtain a strict upper bound on the strong product of two general graphs and obtain examples with King grids that match this bound and other examples for which the guard number is smaller. We also obtain the exact value of the guard number in the lexicographical product of two general graphs for any distance \(d\ge 2\). From the algorithmic point of view, we prove a positive result: if the number k of guards is fixed, the spy game is solvable in polynomial XP time \(O(n^{3k+2})\) for every speed \(s\ge 2\) and distance \(d\ge 0\). This XP algorithm is used to obtain an FPT algorithm on the \(P_4\)-fewness of the graph. As a negative result, we prove that the spy game is W[2]-hard even in bipartite graphs when parameterized by the number of guards, for every speed \(s\ge 2\) and distance \(d\ge 0\), extending the hardness result of Cohen et al. in 2016.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8, 1–12 (1984)
Alon, N., Mehrabian, A.: On a generalization of Meyniel’s conjecture on the cops and robbers game. Electron. J. Comb. 18(1) (2011)
Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for \(k\)-restrictions. ACM Trans. Algorithms 2(2), 153–177 (2006)
Babel, L., Olariu, S.: On the structure of graphs with few \(P_4{\rm ^{\prime }s}\). Discrete Appl. Math. 84, 1–13 (1998)
Balister, P., Bollobás, B., Narayanan, B., Shaw, A.: Catching a fast robber on the grid. J. Comb. Theory Ser. A 152, 341–352 (2017)
Bonato, A., Chiniforooshan, E., Pralat, P.: Cops and robbers from a distance. Theor. Comput. Sci. 411(43), 3834–3844 (2010)
Bonato, A., Nowakovski, R.: The Game of Cops and Robber on Graphs. American Mathematical Society (2011)
Bouznif, M., Darlay, J., Moncel, J., Preissmann, M.: Exact values for three domination-like problems in circular and infinite grid graphs of small height. Discrete Math. Theor. Comput. Sci. 21(3) (2019)
Campos, V., Klein, S., Sampaio, R., Silva, A.: Fixed-parameter algorithms for the cocoloring problem. Discrete Appl. Math. 167, 52–60 (2014)
Campos, V., Linhares-Sales, C., Sampaio, R., Maia, A.K.: Maximization coloring problems on graphs with few P4’s. Discrete Appl. Math. 164, 539–546 (2014)
Campêlo, M., Huiban, C., Sampaio, R., Wakabayashi, Y.: Hardness and inapproximability of convex recoloring problems. Theor. Comput. Sci. 533, 15–25 (2014)
Chalopin, J., Chepoi, V., Nisse, N., Vaxès, Y.: Cop and robber games when the robber can hide and ride. SIAM J. Discrete Math. 25(1), 333–359 (2011)
Cohen, N., Hilaire, M., Martins, N.A., Nisse, N., Pérennes, S.: Spy-game on graphs. In: 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz Intern. Proc. in Informatics (LIPIcs), vol. 49, pp. 10:1–10:16 (2016)
Cohen, N., Martins, N.A., Mc Inerney, F., Nisse, N., Pérennes, S., Sampaio, R.M.: Spy-game on graphs: complexity and simple topologies. Theor. Comput. Sci. 725, 1–15 (2018)
Cohen, N., Mc Inerney, F., Nisse, N., Pérennes, S.: Study of a combinatorial game in graphs through linear programming. Algorithmica 82, 212–244 (2020)
Dantas, R., Havet, F., Sampaio, R.M.: Minimum density of identifying codes of king grids. Discrete Math. 341(10), 2708–2719 (2018)
Fomin, F.V., Golovach, P.A., Kratochvíl, J., Nisse, N., Suchan, K.: Pursuing a fast robber on a graph. Theor. Comput. Sci. 411(7–9), 1167–1181 (2010)
Fomin, F.V., Golovach, P.A., Lokshtanov, D.: Cops and robber game without recharging. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 273–284. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13731-0_26
Fomin, F., Golovach, P.A., Pralat, P.: Cops and robber with constraints. SIAM J. Discrete Math. 26(2), 571–590 (2012)
Goddard, W., Hedetniemi, S., Hedetniemi, S.: Eternal security in graphs. J. Comb. Math. Comb. Comput. 52, 169–180 (2005)
Goldwasser, J.L., Klostermeyer, W.: Tight bounds for eternal dominating sets in graphs. Discrete Math. 308(12), 2589–2593 (2008)
Hammack, R., Imrich, W., Klavz̆ar, S.: Handbook of Product Graphs. CRC Press, Boca Raton (2011)
Klostermeyer, W., MacGillivray, G.: Eternal dominating sets in graphs. J. Comb. Math. Comb. Comput. 68 (2009)
Klostermeyer, W., Mynhardt, C.: Graphs with equal eternal vertex cover and eternal domination numbers. Discrete Math. 311(14), 1371–1379 (2011)
Linhares-Sales, C., Maia, A.K., Martins, N., Sampaio, R.: Restricted coloring problems on graphs with few P4’s. Anna. Oper. Res. 217, 385–397 (2014)
Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235–239 (1983)
Pelto, M.: Optimal \((r,\le 3)\)-locating–dominating codes in the infinite king grid. Discrete Appl. Math. 161(16), 2597–2603 (2013)
Zermelo, E.: Über eine anwendung der mengenlehre auf die theorie des schachspiels. In: Proceedings of the Fifth International Congress of mathematicians, pp. 501–504 (1913)
Acknowledgments
This research was supported by Funcap [4543945/2016] Pronem, CNPq [314031/2018-9] Produtividade, CNPq Universal [425297/2016-0] and [437841/2018-9], CAPES [88887.143992/2017-00] DAAD Probral and CAPES [88881.197438/2018-01] STIC AmSud.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Costa, E.R., Martins, N.A., Sampaio, R. (2021). Spy Game: FPT-Algorithm and Results on Graph Products. In: Chen, CY., Hon, WK., Hung, LJ., Lee, CW. (eds) Computing and Combinatorics. COCOON 2021. Lecture Notes in Computer Science(), vol 13025. Springer, Cham. https://doi.org/10.1007/978-3-030-89543-3_56
Download citation
DOI: https://doi.org/10.1007/978-3-030-89543-3_56
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-89542-6
Online ISBN: 978-3-030-89543-3
eBook Packages: Computer ScienceComputer Science (R0)