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

arXiv: Data Structures and Algorithms, 2019.

Cited by: 0|Bibtex|Views32
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

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 such an exploration is to minimize its total cost, where each edge traversal inc...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments