Deterministic rendezvous in graphs

Algorithmica (New York)

Volumn 46, Issue 1, 2006, Pages 69-96

  Dessmark, Anders ^a   Fraigniaud, Pierre ^b   Kowalski, Dariusz R ^c   Pelc, Andrzej ^d  

^a LUND UNIVERSITY   (Sweden)

^b CNRS   (France)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

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

Author keywords

Algorithm; Deterministic; Graph; Mobile agent; Rendezvous

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MULTI AGENT SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

BOUNDED DEGREE; DETERMINISTIC; GENERIC RENDEZVOUS ALGORITHM; MOBILE AGENT;

GRAPH THEORY;

EID: 33747884150     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0074-2     Document Type: Conference Paper

References (27)

1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, Proc. 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 218-223.
2. S. Alpern, The rendezvous search problem, SIAM Journal on Control and Optimization 33 (1995), 673-683.
3. S. Alpern, Rendezvous search on labelled networks, Naval Research Logistics 49 (2002), 256-274.
4. S. Alpern, V. Baston, and S. Essegaier, Rendezvous search on a graph, Journal of Applied Probability 36 (1999), 223-231.
5. S. Alpern and S. Gal, Rendezvous search on the line with distinguishable players, SIAM Journal on Control and Optimization 33 (1995), 1270-1276.
6. S. Alpern and S. Gal, The Theory of Search Games and Rendezvous, International Series in Operations Research and Management Science, Kluwer, Dordrecht, 2002.
7. E. Anderson and S. Essegaier, Rendezvous search on the line with indistinguishable players, SIAM Journal on Control and Optimization 33 (1995), 1637-1642.
8. E. Anderson and S. Fekete, Asymmetric rendezvous on the plane, Proc. 14th Annual ACM Symposium on Computational Geometry, 1998, pp. 365-373.
9. E. Anderson and S. Fekete, Two-dimensional rendezvous search, Operations Research 49 (2001), 107-118.
10. E. Anderson and R. Weber, The rendezvous problem on discrete locations, Journal of Applied Probability 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 Journal on Control and Optimization 36 (1998), 1880-1889.
12. V. Baston and S. Gal, Rendezvous search when marks are left at the starting points, Naval Research Logistics 48 (2001), 722-731.
13. S.A. Cook and P. McKenzie, Problems complete for deterministic logarithmic space, Journal of Algorithms 8(5) (1987), 385-394.
14. D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random walks on weighted graphs, and applications to on-line algorithms, Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC 1990), pp. 369-378.
15. D. Coppersmith, P. Tetali, and P. Winkler, Collisions among random walks on a graph, SIAM Journal on Discrete Mathematics 6 (1993), 363-374.
16. A. Dessmark, P. Fraigniaud, and A. Pelc, Deterministic rendezvous in graphs, Proc. 11th European Symposium on Algorithms (ESA 2003), LNCS 2832, Springer-Verlag, Berlin, pp. 184-195.
17. M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for estimating volumes of convex bodies, Proc. 21st Annual. ACM Symposium on Theory of Computing (STOC 1989), pp. 375-381.
18. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asynchronous oblivious robots with limited visibility, Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), LNCS 2010, Springer-Verlag, Berlin, pp. 247-258.
19. S. Gal, Rendezvous search on the line, Operations Research 47 (1999), 974-976.
20. A. Israeli and M. Jalfon, Token management schemes and random walks yield self stabilizing mutual exclusion, Proc. 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), pp. 119-131.
21. D. Kowalski and A. Malinowski, How to meet in anonymous network, manuscript.
22. D. Kowalski and A. Pelc, Polynomial deterministic rendezvous in arbitrary graphs, Proc. 15th Annual Symposium on Algorithms and Computation (ISAAC 2004).
23. E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, Mobile agent rendezvous in a ring, Proc. 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp. 592-599.
24. W. Lim and S. Alpern, Minimax rendezvous on the line, SIAM Journal on Control and Optimization 34 (1996), 1650-1665.
25. T. Schelling, The Strategy of Conflict, Oxford University Press, Oxford, 1960.
26. L. Thomas, Finding your kids when they are lost, Journal of the Operational Research Society 43 (1992), 637-639.
27. X. Yu and M. Yung, Agent rendezvous: a dynamic symmetry-breaking problem, Proc. International Colloquium on Automata, Languages, and Programming (ICALP 1996), LNCS 1099, Springer-Verlag, Berlin, pp. 610-621.