Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs

18 Apr 2020 Brandt Sebastian Foerster Klaus-Tycho Maurer Jonathan Wattenhofer Roger

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING