More Efficient Periodic Traversal in Anonymous Undirected Graphs

• Published in: Lecture notes in computer science pp. 167 - 181
• Main Authors: Czyzowicz, Jurek, Dobrev, Stefan, Gąsieniec, Leszek, Ilcinkas, David, Jansson, Jesper, Klasing, Ralf, Lignos, Ioannis, Martin, Russell, Sadakane, Kunihiko, Sung, Wing-Kin
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010
• Series: Lecture Notes in Computer Science
• Subjects: Edge Incident; Port Number; Single Edge; Span Subgraph; Span Tree
• ISBN: 364211475X; 9783642114755
• ISSN: 0302-9743; 1611-3349; 1611-3349
• DOI: 10.1007/978-3-642-11476-2_14

We consider the problem of periodic graph exploration in which a mobile entity with (at most) constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a periodic manner. Graphs are supposed to be anonymous, that is, nodes are unlabeled. However, while visiting a node, the robot has to distinguish between edges incident to it. For each node v the endpoints of the edges incident to v are uniquely identified by different integer labels called port numbers. We are interested in the minimisation of the length of the exploration period. This problem is unsolvable if the local port numbers are set arbitrarily, see [1]. However, surprisingly small periods can be achieved when assigning carefully the local port numbers. Dobrev et al. [2] described an algorithm for assigning port numbers, and an oblivious agent (i.e., an agent with no persistent memory) using it, such that the agent explores all graphs of size n within period 10n. Providing the agent with a constant number of memory bits, the optimal length of the period was proved in [3] to be no more than 3.75n (using a different assignment of the port numbers). In this paper, we improve both these bounds. More precisely, we show a period of length at most $4\frac{1}{3}n$ for oblivious agents, and a period of length at most 3.5n for agents with constant memory. Finally, we give the first non-trivial lower bound, 2.8n, on the period length for the oblivious case.