A finite automaton, simply referred to as a robot, has to explore a graph whose nodes are unlabeled and whose edge ports are locally labeled at each node. The robot has no a priori knowledge of the topology of the graph or of its size. Its task is to traverse all the edges of the graph. We first show that, for any K-state robot and any d≥3, there exists a planar graph of maximum degree d with at most K+1 nodes that the robot cannot explore. This bound improves all previous bounds in the literature. More interestingly, we show that, in order to explore all graphs of diameter D and maximum degree d, a robot needs Ω(Dlogd) memory bits, even if we restrict the exploration to planar graphs. This latter bound is tight. Indeed, a simple DFS up to depth D+1 enables a robot to explore any graph of diameter D and maximum degree d using a memory of size O(Dlogd) bits. We thus prove that the worst case space complexity of graph exploration is Θ(Dlogd) bits.
|Number of pages||14|
|Journal||Theoretical Computer Science|
|State||Published - 22 Nov 2005|
Bibliographical noteFunding Information:
A preliminary version of this paper appeared in the Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS) . E-mail addresses: (P. Fraigniaud), firstname.lastname@example.org (D. Ilcinkas), email@example.com (G. Peer), firstname.lastname@example.org (A. Pelc), email@example.com (D. Peleg). 1 Supported by the project “PairAPair” of the ACI Masses de Données, the project “Fragile” of the ACI Sécurité et Informatique, and by the project “Grand Large” of INRIA. 2Supported in part by NSERC Grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.
- Finite automaton
- Graph exploration
- Mobile agent