Exploration of graphs with excluded minors

Julia Baligacs, Yann Disser, Irene Heinrich +1

We study the online graph exploration problem proposed by Kalyanasundaram and Pruhs (1994) and prove a constant competitive ratio on minor-free graphs. This result encompasses and…