TY - JOUR
T1 - Tree exploration with logarithmic memory
AU - Ambühl, Christoph
AU - Ga̧sieniec, Leszek
AU - Pelc, Andrzej
AU - Radzik, Tomasz
AU - Zhang, Xiaohui
PY - 2011/3
Y1 - 2011/3
N2 - We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected connected graph), and return to the starting node. Nodes of the network are unlabeled and edge ports are locally labeled at each node. The agent has no a priori knowledge of the topology of the network or of its size, and cannot mark nodes in any way. Under such weak assumptions, cycles in the network may prevent feasibility of exploration, hence we restrict attention to trees. We present an algorithm to accomplish tree exploration (with return) using O(log n)-bit memory for all n-node trees. This strengthens the result from Diks et al. [2004], where O(log2 n)-bit memory was used for tree exploration, and matches the lower bound on memory size proved there. We also extend our O(log n)-bit memory traversal mechanism to a weaker model in which ports at each node are ordered in circular manner, however, the explicit values of port numbers are not available.
AB - We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected connected graph), and return to the starting node. Nodes of the network are unlabeled and edge ports are locally labeled at each node. The agent has no a priori knowledge of the topology of the network or of its size, and cannot mark nodes in any way. Under such weak assumptions, cycles in the network may prevent feasibility of exploration, hence we restrict attention to trees. We present an algorithm to accomplish tree exploration (with return) using O(log n)-bit memory for all n-node trees. This strengthens the result from Diks et al. [2004], where O(log2 n)-bit memory was used for tree exploration, and matches the lower bound on memory size proved there. We also extend our O(log n)-bit memory traversal mechanism to a weaker model in which ports at each node are ordered in circular manner, however, the explicit values of port numbers are not available.
KW - Distributed algorithms
KW - Graph exploration
KW - Small memory
UR - http://www.scopus.com/inward/record.url?scp=79953254622&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79953254622&partnerID=8YFLogxK
U2 - 10.1145/1921659.1921663
DO - 10.1145/1921659.1921663
M3 - Article
AN - SCOPUS:79953254622
SN - 1549-6325
VL - 7
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 2
M1 - 17
ER -