Deterministic and probabilistic binary search in graphs
STOC, pp. 519-532, 2016.
We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm’s task is to identify the target by adaptively querying vertices. In response to querying a node q, the algorithm learns either that q is the target, or is given an edge out of q that l...More
PPT (Upload PPT)