More efficient periodic traversal in anonymous undirected graphs

J. Czyzowicz, S. Dobrev, L. Gasieniec +7

We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…