Randomized pursuit-evasion in graphs

Combinatorics Probability and Computing

Volumn 12, Issue 3, 2003, Pages 225-244

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

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

^b UNIVERSITY OF PADERBORN   (Germany)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPH THEORY; RANDOM PROCESSES;

RANDOMIZED PURSUIT-EVASION;

GAME THEORY;

EID: 0038334104     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005625     Document Type: Conference Paper

References (19)

1. Aleliunas, R., Karp, R. M., Lipton, R. J., Lovász, L. and Rackoff, C. (1979) Random walks, universal traversal sequences, and the complexity of maze problems. In Proc. 20th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 218-223.
2. Alpern, S. (1974) The search game with mobile hider on the circle. Differential Games and Control Theory, pp. 181-200.
3. Chatzigiannakis, I., Nikoletseas, S., Paspallis, N., Spirakis, P. and Zaroliagis, C. (2001) An experimental study of basic communication protocols in ad-hoc mobile networks. In Proc. 5th Workshop on Algorithmic Engineering, pp. 159-171.
4. Chatzigiannakis, I., Nikoletseas, S. and Spirakis, P. (2001) An efficient communication strategy for ad-hoc mobile networks. In Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 320-322.
5. Efrat, A., Guibas, L. J., Har-Peied, S., Lin, D. C., Mitchell, J. S. B. and Murali, T. M. (2000) Sweeping simple polygons with a chain of guards. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 927-936.
6. Franklin, M. K., Galil, Z. and Yung, M. (2000) Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. J. Assoc, Comput. Mach. 47 225-243.
7. Gal, S. (1979) Search games with mobile and immobile hider. SIAM J. Control Optim. 17 99-122.
8. Guibas, L. J., Latombe, J.-C., LaValle, S. M., Lin, D. and Motwani, R. (1999) A visibility-based pursuit-evasion problem. Internat. J. Comput. Geom. Appl. 9 471-493.
9. Hatzis, K., Pentaris, G., Spirakis, P. and Tampakas, V. (1998) Implementation and testing eavesdropper protocols using the DSP tool. In Proc. 2nd Workshop on Algorithm Engineering (WAE), pp. 74-85.
10. Isaacs, R. (1965) Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization, Wiley, New York/London/Sydney.
11. Kirousis, L. M. and Papadimitriou, C. H. (1986) Searching and pebbling. Theoret. Comput. Sci. 47 205-218.
12. LaPaugh, A. S. ( 1993) Recontamination does not help to search a graph. J. Assoc. Comput. Mach. 40 224-245.
13. LaValle, S. M. and Hinrichsen, J. (1999) Visibility-based pursuit-evasion: The case of curved environments. In Proc. IEEE International Conference on Robotics and Automation (ICRA), pp. 1677-1682.
14. Megiddo, N., Hakimi, S. L., Garey, M. R., Johnson, D. S. and Papadimitriou, C. H. (1988) The complexity of searching a graph. J. Assoc. Comput. Mach. 35 18-44.
15. Park, S.-M, Lee, J.-H. and Chwa, K.-Y. (2001) Visibility-based pursuit-evasion in a polygonal region by a searcher. In Proc. 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 456-468.
16. Parsons, T. D. (1976) Pursuit-evasion in a graph. In Theory and Applications of Graphs (Y. Alavi and D. Lick, eds), Lecture Notes in Mathematics, Springer, pp. 426-441.
17. Parsons, T. D. (1978) The search number of a connected graph. In Proc. 9th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 549-554.
18. Suzuki, I. and Yamashita, M. (1992) Searching for a mobile intruder in a polygonal region. SIAM J. Comput. 21 863-888.
19. Zelikin, M. I. (1972) A certain differential game with incomplete information (Russian). Dokl. Akad. Nauk 202 998-1000.