Abstract:We consider the problem of finding an edge in a hidden undirected graph G = (V, E) with n vertices, in a model where we only allowed queries that ask whether or not a subset of vertices contains an edge. We study the non-adaptive model and show that while in the deterministic model the optimal algorithm requires n 2 queries (i.e., querying for any possible edge separately), in the randomized model Θ (n) queries are sufficient (and needed) in order to find an edge. In addition, we study the query complexity for… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.