Fast periodic graph exploration with constant memory

• Authors: Leszek Gąsieniec;Ralf Klasing;Russell Martin;Alfredo Navarra;Xiaohui Zhang
• Venue: SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
• Year: 2007

We consider the problem of periodic exploration of all nodes in undirected graphs by using a finite state automaton called later a robot. The robot, using a constant number of states (memory bits), must be able to explore any unknown anonymous graph. The nodes in the graph are neither labelled nor colored. However, while visiting a node v the robot can distinguish between edges incident to it. The edges are ordered and labelled by consecutive integers 1, . . . , d(v) called port numbers, where d(v) is the degree of v. Periodic graph exploration requires that the automaton has to visit every node infinitely many times in a periodic manner. Note that the problem is unsolvable if the local port numbers are set arbitrarily, see [8]. In this context, we are looking for the minimum function π(n), such that, there exists an efficient deterministic algorithm for setting the local port numbers allowing the robot to explore all graphs of size n along a traversal route with the period π(n). Dobrev et al. proved in [13] that for oblivious robots π(n) ≤ 10n. Recently Ilcinkas proposed another port labelling algorithm for robots equipped with two extra memory bits, see [20], where the exploration period π(n) ≤ 4n-2. In the same paper, it is conjectured that the bound 4n - O(1) is tight even if the use of larger memory is allowed. In this paper, we disprove this conjecture presenting an efficient deterministic algorithm arranging the port numbers, such that, the robot equipped with a constant number of bits is able to complete the traversal period in π(n) ≤ 3.75n -2 steps hence decreasing the existing upper bound. This reduces the gap with the lower bound of π(n) ≥ 2n - 2 holding for any robot.