Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time

DOI10.1007/s10208-014-9215-yzbMath1347.05227arXiv1304.7047MaRDI QIDQ896557

Andrea Montanari, Yash Deshpande

Publication date: 10 December 2015

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7047

zbMATH Keywords

random graphs; average case complexity; sparse recovery; local algorithms; belief propagation; approximate message passing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C80: Random graphs (graph-theoretic aspects)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Uses Software

• LAS