Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 599-608

  Ta Shma, Amnon ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EXPLICIT CONSTRUCTIONS; EXPLORATION SEQUENCES; RENDEZVOUS PROBLEMS; TRAVERSAL SEQUENCES; UNDIRECTED GRAPH;

ALGORITHMS;

EID: 84860831356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. [AKL+79] 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. In Proc. of the 20th FOCS, pages 218-223, 1979.
2. [AS00] N. Alon and J. Spencer. The Probabilistic Method. John Wiley, 2000.
3. [CTW93] D. Coppersmith, P. Tetali, and P. Winkler. Collisions among random walks on a graph. SIAM Journal on Discrete Mathematics, 6(3):363-374, 1993.
4. [DFKP06] A. Dessmark, P. Fraigniaud, D. Kowalski, and A. Pelc. Deterministic rendezvous in graphs. Algorithmica, 2006. Online publication June 19, 2006.
5. [DFP03] A. Dessmark, P. Fraigniaud, and A. Pelc. Deterministic rendezvous in graphs. In Proc. of 11th ESA, pages 184-195, 2003.
6. [DGK+06] G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, and U. Vaccaro. Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science, 355(3):315-326, 2006.
7. [EL75] P. Erdös and L. Lovasz. Problems and results on 3-chromatic hypergraphs and some related questions. In A. Hajnal et al., editors, Infinite and Finite Sets, volume 11 of Colloq. Math. Soc. Janos Bolyai, pages 609-627. North-Holland, 1975.
8. [KM06] D.R. Kowalski and A. Malinowski. How to meet in anonymous network. In Proc. of 13th SIROCCO, pages 44-58, 2006.
9. [Kou02] M. Koucký. Universal traversal sequences with backtracking. Journal of Computer and System Sciences, 65(4):717-726, 2002.
10. [KP04] D.R. Kowalski and A. Pelc. Polynomial deterministic rendezvous in arbitrary graphs. In Proc. of 15th ISAAC, pages 644-656, 2004.
11. [Rei05] O. Reingold. Undirected ST-connectivity in logspace. In Proc. of 37th STOC, pages 376-385, 2005.