Tree exploration with little memory
A robot with i-bit memory has to explore a tree whose nodes are unlabeled and edge ports are locally labeled at each node. The robot has no a priori knowledge of the topology of the tree or of its size, and its aim is to traverse all the edges. While O(logA) bits of memory suffice to explore any tree of maximum degree A if stopping is not required, we show that bounded memory is not sufficient to explore with stop all trees of bounded degree (indeed Q(logloglog n) bits of memory are needed for some such trees of size n). For the more demanding task requiring to stop at the starting node after completing exploration, we show a sharper lower bound fi(logn) on required memory size, and present an algorithm to accomplish this task with O(log2 n)-bit memory, for all n-node trees.
|Conference||13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002|
Diks, K. (Krzysztof), Fraigniaud, P. (Pierre), Kranakis, E, & Pelc, A. (Andrzej). (2002). Tree exploration with little memory. Presented at the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002.