Randomized pursuit-evasion in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 901-912

  Adler, Micah ^a   Räcke, Harald ^b   Sivadasan, Naveen ^c   Sohler, Christian ^b   Vöcking, Berthold ^c  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

CONSTANT FACTORS; GENERAL GRAPH; GRAPH G; LOWER BOUNDS; PURSUIT EVASION; PURSUIT EVASION GAMES; UNDIRECTED GRAPH; UPPER BOUND;

GRAPH THEORY;

EID: 84869147896     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_77     Document Type: Conference Paper

References (16)

1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science (FOCS), pages 218-223, 1979.
2. I. Chatzigiannakis, S. Nikoletseas, N. Paspallis, P. Spirakis, and C. Zaroliagis.Anexperimental study of basic communication protocols in ad-hoc mobile networks. In Proceedings of the 5thWorkshop on Algorithmic Engineering, pages 159-171.
3. I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. Self-organizing ad-hoc mobile networks: The problem of end-to-end communication. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC 2001), 2001.
4. A. Efrat, L. J. Guibas, S. Har-Peled, D. C. Lin, J. S. B. Mitchell, and T. M. Murali. Sweeping simple polygons with a chain of guards. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 927-936, 2000.
5. M. K. Franklin, Z. Galil, and M.Yung. Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. Journal of the ACM, 47(2):225-243, 2000.
6. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications (IJCGA), 9(4):471-493, 1999.
7. K. Hatzis, G. Pentaris, P. Spirakis, andV.Tampakas. Implementation and testing eavesdropper protocols using the DSP tool. In Proceedings of the 2ndWorkshop on Algorithm Engineering (WAE), pages 74-85, 1998.
8. L. M. Kirousis and C. H. Papadimitriou. Searching and pebbling. Theoretical Computer Science, 47:205-218, 1986.
9. A. S. LaPaugh. Recontamination does not help to search a graph. Journal of the ACM, 40(2):224-245, 1993.
10. S. M. LaValle and J. Hinrichsen. Visibility-based pursuit-evasion: The case of curved environments. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages 1677-1682, 1999.
11. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. Journal of the ACM, 35(1):18-44, 1988.
12. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
13. S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polgonal region by a searcher. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pages 456-468, 2001.
14. T. D. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. Lick, editors, Theory and Applications of Graphs, Lecture Notes in Mathematics, pages 426-441. Springer, 1976.
15. T. D. Parsons. The search number of a connected graph. In Proceedings of the 9th Southeastern Conference on Combinatorics, Graph Theory and Computing, pages 549-554, 1978.
16. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992.