A Framework for Searching in Graphs in the Presence of Errors

Dariusz Dereniowski, Stefan Tiegel, Przemysław Uznański +1

We consider the problem of searching for an unknown target vertex $t$ in a (possibly edge-weighted) graph. Each \emph{vertex-query} points to a vertex $v$ and the response either a…