1 paper
Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer +1
We study the problem of online graph exploration on undirected graphs, where a searcher has to visit every vertex and return to the origin. Once a new vertex is visited, the search…