Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs

Abstract 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 searcher learns of all neighboring vertices and the connecting edge weights. The goal of such an exploration is to minimize its total cost, where each edge...More