Skip to main content
SpringerLink
Log in

Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The studies of the classical cops and robber problem are generally aimed at determining the minimum number of cops needed to capture the robber, and proposing algorithms for the capture. This paper is a contribution to this problem, directed to two-dimensional grids, cylinders (i. e., grids with toroidal closure in one dimension), and tori, with a new extension to using teams of any number of cops. We discuss some new features of the problem and propose a new solution to the capture problem on grids that was already solved under a different approach, and then give efficient capture algorithms on cylinders and tori making use of these features. We examine the effect of using teams of any number k of cops and give efficient algorithms for this case, evaluating lower and upper bounds on the capture time \(t_k\), and compute the minimum value of k needed for any given capture time. To this aim we extend the concept of work \(w_k=k\cdot t_k\) of an algorithm, inherited from parallel processing, and study a possible speed-up phenomenon using larger teams of cops.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Aigner M, Fromme M (1984) A game of cops and robbers. Discrete Appl Math 8:1–12

    Article  MathSciNet  Google Scholar 

  2. Alspach B (2004) Searching and sweeping graphs: a brief survey. Le Matematiche 59(I–II):5–37

    MathSciNet  MATH  Google Scholar 

  3. Bhattacharya S, Paul G, Sanyal S (2010) A cops and robber game in multidimensional grids. Discrete Appl Math 158:1745–1751

    Article  MathSciNet  Google Scholar 

  4. Bhattacharya S, Banerjee A, Badyopadhay S (2005) CORBA-based analysis of multi-agent behavior. J Comput Sci Technol 20(1):118–124

    Article  Google Scholar 

  5. Blin L, Fraignaud P, Nisse N, Vial S (2008) Distributed chasing of network intruders. Theor Comput Sci 399:12–37

    Article  MathSciNet  Google Scholar 

  6. Bonato A, et al (2019) Optimizing the trade-off between number of cops and capture time in Cops and Robbers. arXiv:1903.10087v2

  7. Bonato A, Golovach P, Hahn G, Kratochvil J (2009) The capture time of a graph. Dicrete Math 309:5588–5595

    Article  MathSciNet  Google Scholar 

  8. Bonato A, Nowakovski R (2011) The game of cops and robbers on graphs. American Mathematical Society, Providence

    Book  Google Scholar 

  9. Cohen N, Hilaire M, Martins NA, Nisse N, Perennes S (2016) Spy-game on graphs. In: Proceedings of 8-th International Conference FUN 2016. https://doi.org/10.4230/LIPIcs.FUN.2016.10

  10. Dawes R (1992) Some pursuit-evasion problems on grids. Inf Process Lett 43:241–247

    Article  MathSciNet  Google Scholar 

  11. Dumitrescu A, Kok H, Suzuki I, Zylinski P (2008) Vision based pursuit-evasion on a grid. In: Proceedings of 11-th Scandinavian Workshop on Algorithm Theory, SWAT 2008, LNCS 5124, pp 45–64

  12. Ellis J, Warren R (2008) Lower bounds on the pathwidth of some grid-like graphs. Discrete Appl Math 156:545–555

    Article  MathSciNet  Google Scholar 

  13. Fomin F, Golovach P, Kratochvil J, Nisse N, Suchan K (2010) Pursuing a fast robber on a graph. Theor Comput Sci 411:1167–1181

    Article  MathSciNet  Google Scholar 

  14. Ilcinkas D, Nisse N, Soguet D (2009) The cost of monotonicity in distributed graph searching. Distrib Comput 22(2):117–127

    Article  Google Scholar 

  15. Goldstein F, Reingold E (1995) The complexity of pursuing a graph. Theor Comput Sci 143:93–112

    Article  Google Scholar 

  16. Karp RM, Ramachandran V (1990) Parallel algorithms for shared memory machines. In: van Leeuwen J (ed) Handbook of Theoretical Computer Science, vol A. North Holland, New York, pp 869–941

    Google Scholar 

  17. Kinnersley WB (2015) Cops and Robbers is EXPTIME-complete. J Comb Theory Ser B 111:201–220

    Article  MathSciNet  Google Scholar 

  18. Luccio F, Pagli L, Pucci G (1992) Three non conventional paradigms of parallel computation. In: Parallel Architectures and Their Efficient use. LNCS, 678. pp 166–175

  19. Luccio F, Pagli L, Santoro N (2007) Network decontamination in presence of local immunity. Int J Found Comput Sci 18(3):457–474

    Article  MathSciNet  Google Scholar 

  20. Luccio F, Pagli L (2009) A general approach to toroidal mesh decontamination with local immunity. In: Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium, (IPDPS). pp 1–8

  21. Luccio F, Pagli L (2016) More agents may decrease global work: a case in butterflies decontamination. Theor Comput Sci 655:41–57

    Article  Google Scholar 

  22. Luccio F, Pagli L (2019) Captures on grids and tori with different number of cops. In: Proceedings of 15-th International Conference on Parallel and Computing Technologies. (PACT) LNCS 11657. pp 431–444

  23. Luccio F, Pagli L (2019) Cops and robber on grids and tori. arXiv:1708.08255

  24. Maamoun M, Meyniel H (1988) On a game of policemen and robber. Discrete Appl Math 17:18–44

    MathSciNet  MATH  Google Scholar 

  25. Megiddo N, Hakimi S, Garey M, Johnson D, Papadimitriou C (1987) The complexity of searching a graph. J ACM 35(1):307–309

    MathSciNet  MATH  Google Scholar 

  26. Mehrabian A (2011) The capture time of grids. Discrete Math 311:102–105

    Article  MathSciNet  Google Scholar 

  27. Neufeld S (1996) A pursuit-evasion problem on a grid. Inf Process Lett 58:5–9

    Article  MathSciNet  Google Scholar 

  28. Neufeld S, Nowakovsky R (1998) A game on cops and robbers played on products of graphs. Discrete Math 186:253–268

    Article  MathSciNet  Google Scholar 

  29. Nowakowski R, Winkler P (1983) Vertex-to-vertex pursuit in a graph. Discrete Math 43:253–259

    MathSciNet  MATH  Google Scholar 

  30. Pisantechakool P, Tan X (2016) On the capture time of cops and robbers game on a planar graph. In: Chan T-HH, et al (eds.) Proceedings of COCOA 2016, LNCS 10043. pp 3–17

  31. Quillot A (1978) These di \(3^{\circ }\) cycle. Universit de Paris VI:131–145

    Google Scholar 

  32. Sugihara K, Suzuki I (1989) Optimal algorithm for a pursuit-evasion problem. SIAM J Discrete Math 2:126–143

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Pisa, Pisa, Italy

    Fabrizio Luccio & Linda Pagli

Authors
  1. Fabrizio Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linda Pagli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Linda Pagli.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A preliminary version of this work has been deposited in the arXiv repository [23]. Some of the results, without formal proofs, have been presented in [23].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Luccio, F., Pagli, L. Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops. J Supercomput 77, 9746–9770 (2021). https://doi.org/10.1007/s11227-021-03655-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03655-1

Keywords

Search

Navigation