The Reduced Automata Technique for Graph Exploration Space Lower Bounds - Archive ouverte HAL Access content directly
Book Sections Year : 2006

The Reduced Automata Technique for Graph Exploration Space Lower Bounds


We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, modeled as finite automata. For exploration to be completed, each edge of the graph has to be traversed by at least one robot. In this paper, the robots have no a priori knowledge of the topology of the graph, nor of its size, and we are interested in the amount of memory the robots need to accomplish exploration, We introduce the so-called {\em reduced automata technique}, and we show how to use this technique for deriving several space lower bounds for exploration. Informally speaking, the reduced automata technique consists in reducing a robot to a simpler form that preserves its “core” behavior on some graphs. Using this technique, we first show that any set of $q\geq 1$ non-cooperative robots, requires $\Omega(\log(\frac{n}{q}))$ memory bits to explore all $n$-node graphs. The proof implies that, for any set of $q K$-state robots, there exists a graph of size $O(qK)$ that no robot of this set can explore, which improves the $O(K^{O(q)})$ bound by Rollik (1980). Our main result is an application of this latter result, concerning {\em terminating} graph exploration with one robot, i.e., in which the robot is requested to stop after completing exploration. For this task, the robot is provided with a pebble, that it can use to mark nodes (without such a marker, even terminating exploration of cycles cannot be achieved). We prove that terminating exploration requires $\Omega(\log n)$ bits of memory for a robot achieving this task in all $n$-node graphs.
Fichier principal
Vignette du fichier
EVEN.pdf (336.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00341655 , version 1 (25-11-2008)



Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum, Sébastien Tixeuil. The Reduced Automata Technique for Graph Exploration Space Lower Bounds. Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman. Essays in Memory of Shimon Even, Springer Berlin / Heidelberg, Volume LNCS 3895, p. 1-26, 2006, Lecture Notes in Computer Science, ⟨10.1007/11685654_1⟩. ⟨hal-00341655⟩
251 View
192 Download



Gmail Facebook Twitter LinkedIn More