DeepAI AI Chat
Log In Sign Up

Finding cliques using few probes

09/18/2018
by   Uriel Feige, et al.
MIT
Princeton University
Weizmann Institute of Science
Georgia Institute of Technology
0

Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an n vertex graph, and need to output a clique. We show that if the input graph is drawn at random from G_n,1/2 (and hence is likely to have a clique of size roughly 2 n), then for every δ < 2 and constant ℓ, there is an α < 2 (that may depend on δ and ℓ) such that no algorithm that makes n^δ probes in ℓ rounds is likely (over the choice of the random graph) to output a clique of size larger than α n.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/11/2021

A tight bound for the clique query problem in two rounds

We consider a problem introduced by Feige, Gamarnik, Neeman, Rácz and Te...
03/28/2019

Finding a planted clique by adaptive probing

We consider a variant of the planted clique problem where we are allowed...
04/06/2023

Improved Hardness of Approximating k-Clique under ETH

In this paper, we prove that assuming the exponential time hypothesis (E...
07/03/2019

Solving Partial Assignment Problems using Random Clique Complexes

We present an alternate formulation of the partial assignment problem as...
02/21/2018

MIS in the Congested Clique Model in O( Δ) Rounds

We give a maximal independent set (MIS) algorithm that runs in O(Δ) roun...
10/31/2018

A tutorial on MDL hypothesis testing for graph analysis

This document provides a tutorial description of the use of the MDL prin...
11/05/2020

MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width

Seese's conjecture for finite graphs states that monadic second-order lo...