Finding Hidden Cliques of Size \sqrt{N/e} in Nearly Linear Time

Yash Deshpande Andrea Montanari

Published in: CoRR (2013)

Keyphrases

maximum clique
maximal cliques
worst case
lower bound
small size
computational complexity
artificial intelligence
data streams
database systems
databases
upper bound
case study
branch and bound algorithm
standard deviation
knowledge base
search engine
scales linearly