Asynchronous deterministic rendezvous in graphs

Theoretical Computer Science

Volumn 355, Issue 3, 2006, Pages 315-326

  De Marco, Gianluca ^a   Gargano, Luisa ^a   Kranakis, Evangelos ^b   Krizanc, Danny ^c   Pelc, Andrzej ^d   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b CARLETON UNIVERSITY   (Canada)

^c WESLEYAN UNIVERSITY   (United States)

^d UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Asynchronous; Deterministic; Graph; Rendezvous

Indexed keywords

ALGORITHMS; SOFTWARE AGENTS; TOPOLOGY;

ASYNCHRONOUS; DETERMINISTIC; RENDEZVOUS;

GRAPH THEORY;

EID: 33644883705     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.12.016     Document Type: Article

References (24)

1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proc. Annu. Symp. on Foundations of Computer Science FOCS'1979, pp. 218-223.
2. S. Alpern The rendezvous search problem SIAM J. Control Optim. 33 1995 673 683
3. S. Alpern Rendezvous search on labelled networks Naval Res. Logist. 49 2002 256 274
4. J. Alpern, V. Baston, and S. Essegaier Rendezvous search on a graph J. Appl. Probab. 36 1999 223 231
5. S. Alpern, and S. Gal Rendezvous search on the line with distinguishable players SIAM J. Control Optim. 33 1995 1270 1276
6. S. Alpern, S. Gal, The theory of search games and rendezvous, International Series in Operations Research and Management Science, vol. 55, Kluwer Academic Publishers, Dordrecht, 2002.
7. E. Anderson, and S. Essegaier Rendezvous search on the line with indistinguishable players SIAM J. Control Optim. 33 1995 1637 1642
8. E. Anderson, S. Fekete, Asymmetric rendezvous on the plane, in: Proc. 14th Annu. ACM Symp. on Computational Geometry, 1998.
9. E. Anderson, and S. Fekete Two-dimensional rendezvous search Oper. Res. 49 2001 107 118
10. E. Anderson, and R. Weber The rendezvous problem on discrete locations J. Appl. Probab. 28 1990 839 851
11. V. Baston, and S. Gal Rendezvous on the line when the players' initial distance is given by an unknown probability distribution SIAM J. Control Optim. 36 1998 1880 1889
12. V. Baston, and S. Gal Rendezvous search when marks are left at the starting points Naval Res. Logist. 48 2001 722 731
13. D. Coppersmith, P. Doyle, P. Raghavan, M. Snir, Random walks on weighted graphs, and applications to on-line algorithms, in: Proc. 22nd Annu. ACM Symp. on Theory of Computing (STOC'1990), pp. 369-378.
14. A. Dessmark, P. Fraigniaud, A. Pelc, Deterministic rendezvous in graphs, in: Proc. 11th Annu. European Symp. on Algorithms (ESA'2003), Lecture Notes in Computer Science, vol. 2832, Springer, Berlin, pp. 184-195.
15. M. Dyer, A. Frieze, R. Kannan, A random polynomial time algorithm for estimating volumes of convex bodies, in: Proc. 21st Annu. ACM Symp. on Theory of Computing (STOC'1989), pp. 375-381.
16. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, in: Proc. 18th Annu. Symp. on Theoretical Aspects of Computer Science STACS'2001, Lecture Notes in Computer Science, vol. 2010, Springer, Berlin, pp. 247-258.
17. S. Gal Rendezvous search on the line Oper. Res. 47 1999 974 976
18. A. Israeli, M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, in: Proc. PODC'1990, pp. 119-131.
19. D. Kowalski, A. Pelc, Polynomial deterministic rendezvous in arbitrary graphs, in: Proc. 15th Annu. Symp. on Algorithms and Computation (ISAAC'2004), Hong Kong, December 2004.
20. E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk, Mobile agent rendezvous in a ring, in: Proc. 23rd Internat. Conf. on Distributed Computing Systems (ICDCS'2003), Providence, RI, USA, May 19-23, pp. 592-599.
21. W. Lim, and S. Alpern Minimax rendezvous on the line SIAM J. Control Optim. 34 1996 1650 1665
22. T. Schelling The Strategy of Conflict 1960 Oxford University Press Oxford
23. L. Thomas Finding your kids when they are lost J. Oper. Res. Soc. 43 1992 637 639
24. X. Yu, M. Yung, Agent rendezvous: a dynamic symmetry-breaking problem, in: Proc. Internat. Colloq. on Automata, Languages, and Programming (ICALP'1996), Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, pp. 610-621.