Deterministic and probabilistic binary search in graphs

STOC, pp. 519-532, 2016.

Cited by: 26|Bibtex|Views30|DOI:https://doi.org/10.1145/2897518.2897656
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com|arxiv.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments