Skip to Main content Skip to Navigation

Time vs. space trade-offs for rendezvous in trees

Jurek Czyzowicz 1 Adrian Kosowski 2 Andrzej Pelc 1
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : Two identical (anonymous) mobile agents start from arbitrary nodes of an unknown tree and have to meet at some node. Agents move in synchronous rounds: in each round an agent can either stay at the current node or move to one of its neighbors. We consider deterministic algorithms for this rendezvous task. The main result of this paper is a tight trade-off between the optimal time of completing rendezvous and the size of memory of the agents. For agents with $k$ memory bits, we show that optimal rendezvous time is $\Theta(n+n^2/k)$ in $n$-node trees. More precisely, if $k \geq c\log n$, for some constant $c$, we design agents accomplishing rendezvous in arbitrary trees of unknown size $n$ in time $O(n+n^2/k)$, starting with arbitrary delay. We also show that no pair of agents can accomplish rendezvous in time $o(n+n^2/k)$, even in the class of lines of known length and even with simultaneous start. Finally, we prove that at least logarithmic memory is necessary for rendezvous, even for agents starting simultaneously in a $n$-node line.
Complete list of metadatas
Contributor : Adrian Kosowski <>
Submitted on : Thursday, December 1, 2011 - 12:48:20 AM
Last modification on : Thursday, January 11, 2018 - 6:22:11 AM
Long-term archiving on: : Friday, March 2, 2012 - 2:21:08 AM


Files produced by the author(s)


  • HAL Id : hal-00646912, version 1


Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc. Time vs. space trade-offs for rendezvous in trees. [Research Report] 2011, pp.20. ⟨hal-00646912v1⟩