Deterministic Graph Exploration with Advice

Barun Gorain, Andrzej Pelc

We consider the task of graph exploration. An $n$-node graph has unlabeled nodes, and all ports at any node of degree $d$ are arbitrarily numbered $0,\dots ,d-1$. A mobile agent ha…