DOI: 10.1007/978-3-642-11476-2_14
View full text

Abstract: Abstract. 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 identi ed by di erent integer labels called port numbers. We are interest…

expand abstract