Zero-Memory Graph Exploration with Unknown Inports

Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger +1

We study a very restrictive graph exploration problem. In our model, an agent without persistent memory is placed on a vertex of a graph and only sees the adjacent vertices. The go…