Finding hidden cliques in linear time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2010

Finding hidden cliques in linear time


In the hidden clique problem, one needs to find the maximum clique in an $n$-vertex graph that has a clique of size $k$ but is otherwise random. An algorithm of Alon, Krivelevich and Sudakov that is based on spectral techniques is known to solve this problem (with high probability over the random choice of input graph) when $k \geq c \sqrt{n}$ for a sufficiently large constant $c$. In this manuscript we present a new algorithm for finding hidden cliques. It too provably works when $k > c \sqrt{n}$ for a sufficiently large constant $c$. However, our algorithm has the advantage of being much simpler (no use of spectral techniques), running faster (linear time), and experiments show that the leading constant $c$ is smaller than in the spectral approach. We also present linear time algorithms that experimentally find even smaller hidden cliques, though it remains open whether any of these algorithms finds hidden cliques of size $o(\sqrt{n})$.
Fichier principal
Vignette du fichier
dmAM0114.pdf (395.93 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01185601 , version 1 (20-08-2015)



Uriel Feige, Dorit Ron. Finding hidden cliques in linear time. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.189-204, ⟨10.46298/dmtcs.2802⟩. ⟨hal-01185601⟩


190 View
1379 Download



Gmail Facebook Twitter LinkedIn More