Finding a Hidden Edge

by   Ron Kupfer, et al.

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 n2 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 specific families of graphs, including Stars, Cliques, and Matchings, for both the randomized and deterministic models. Lastly, for general graphs, we show a trade-off between the query complexity and the number of rounds, r, made by an adaptive algorithm. We present two algorithms with O(rn^2/r) and Õ(rn^1/r) sample complexity for the deterministic and randomized models, respectively.


page 1

page 2

page 3

page 4


Deterministic Algorithms for the Hidden Subgroup Problem

In this note, we present deterministic algorithms for the Hidden Subgrou...

Graph Connectivity and Single Element Recovery via Linear and OR Queries

We study the problem of finding a spanning forest in an undirected, n-ve...

On Queries Determined by a Constant Number of Homomorphism Counts

It is well known [Lovász, 1967] that up to isomorphism a graph G is dete...

Efficient Deterministic Quantitative Group Testing for Precise Information Retrieval

The Quantitative Group Testing (QGT) is about learning a (hidden) subset...

Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size

Consider the following computational problem: given a regular digraph G=...

The Power of Many Samples in Query Complexity

The randomized query complexity R(f) of a boolean function f{0,1}^n→{0,1...

Between the deterministic and non-deterministic query complexity

We consider problems that can be solved by asking certain queries. The d...

Please sign up or login with your details

Forgot password? Click here to reset