DeepAI AI Chat
Log In Sign Up

A tight bound for the clique query problem in two rounds

by   Uriel Feige, et al.
Weizmann Institute of Science

We consider a problem introduced by Feige, Gamarnik, Neeman, Rácz and Tetali [2020], that of finding a large clique in a random graph G∼ G(n,1/2), where the graph G is accessible by queries to entries of its adjacency matrix. The query model allows some limited adaptivity, with a constant number of rounds of queries, and n^δ queries in each round. With high probability, the maximum clique in G is of size roughly 2log n, and the goal is to find cliques of size αlog n, for α as large as possible. We prove that no two-rounds algorithm is likely to find a clique larger than 4/3δlog n, which is a tight upper bound when 1≤δ≤6/5. For other ranges of parameters, namely, two-rounds with 6/5<δ<2, and three-rounds with 1≤δ<2, we improve over the previously known upper bounds on α, but our upper bounds are not tight. If early rounds are restricted to have fewer queries than the last round, then for some such restrictions we do prove tight upper bounds.


page 1

page 2

page 3

page 4


Finding cliques using few probes

Consider algorithms with unbounded computation time that probe the entri...

Finding Subgraphs in Highly Dynamic Networks

In this paper we consider the fundamental problem of finding subgraphs i...

Tight Distributed Listing of Cliques

Much progress has recently been made in understanding the complexity lan...

Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem

We consider a variant of the clustering problem for a complete weighted ...

Topology Dependent Bounds For FAQs

In this paper, we prove topology dependent bounds on the number of round...

Constant Delay Lattice Train Schedules

The following geometric vehicle scheduling problem has been considered: ...

The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries

Two widely-used computational paradigms for sublinear algorithms are usi...