Skip to main content
SpringerLink
Log in

Computing the One-Visibility Cop-Win Strategies for Trees

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13135))

  • 783 Accesses

Abstract

We investigate the one-visibility cops and robber game on trees. For a tree, we use copnumbers of its subtrees to characterize a key structure, called road. We give an \(O(n \log n)\) time algorithm to compute an optimal cop-win strategy for a tree with n vertices.

Research supported in part by an NSERC Discovery Research Grant, Application No.: RGPIN-2018-06800.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bonato, A., Nowakowski, R.J.: The Game of Cops and Robbers on Graphs. American Mathematical Society, Providence (2011)

    Book  Google Scholar 

  2. Bonato, A., Yang, B.: Graph searching and related problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1511–1558. Springer, New York (2013). https://doi.org/10.1007/978-1-4419-7997-1_76

    Chapter  Google Scholar 

  3. Clarke, N.E., Cox, D., Duffy, C., Dyer, D., Fitzpatrick, S., Messinger, M.-E.: Limited visibility Cops and Robbers, 2017. Discrete Appl. Math. 282, 53–64 (2020)

    Article  MathSciNet  Google Scholar 

  4. Megiddo, N., Hakimi, S.L., Garey, M., Johnson, D., Papadimitriou, C.H.: The complexity of searching a graph. J. ACM 35, 18–44 (1988)

    Article  MathSciNet  Google Scholar 

  5. Nowakowski, R.J., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235–239 (1983)

    Article  MathSciNet  Google Scholar 

  6. Quilliot, A.: Jeux et pointes fixes sur les graphes, Thèse de 3ème cycle, Université de Paris VI, 131–145 (1978)

    Google Scholar 

  7. Tošić, R.: Vertex-to-vertex search in a graph. In: Proceedings of the Sixth Yugoslav Seminar on Graph Theory, pp. 233–237, University of Novi Sad (1985)

    Google Scholar 

  8. Xue, Y., Yang, B., Zilles, S.: A simple method for proving lower bounds in the zero-visibility cops and robber game. J. Combin. Optim. (2021). http://link.springer.com/article/10.1007/s10878-021-00710-8

  9. Yang, B., Zhang, R., Cao, Y., Zhong, F.: Search numbers in networks with special topologies. J. Interconnect. Netw. 19, 1–34 (2019)

    Article  Google Scholar 

  10. Yang, B., Akter, T.: One-visibility cops and robber on trees. Theor. Comput. Sci. 886, 139–156 (2021)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, Canada

    Boting Yang

Authors
  1. Boting Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boting Yang .

Editor information

Editors and Affiliations

  1. University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  2. University of New Brunswick, Fredericton, NB, Canada

    Donglei Du

  3. Tianjin University of Technology, Tianjin, China

    Chenchen Wu

  4. Beijing University of Technology, Beijing, China

    Dachuan Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yang, B. (2021). Computing the One-Visibility Cop-Win Strategies for Trees. In: Du, DZ., Du, D., Wu, C., Xu, D. (eds) Combinatorial Optimization and Applications. COCOA 2021. Lecture Notes in Computer Science(), vol 13135. Springer, Cham. https://doi.org/10.1007/978-3-030-92681-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92681-6_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92680-9

  • Online ISBN: 978-3-030-92681-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation