A new approach to the planted clique problem

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 2, Issue , 2008, Pages 187-198

  Frieze, Alan ^a   Kannan, Ravi ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Planted Clique; Random Graph; Tensor

Indexed keywords

NEW APPROACHES; PLANTED CLIQUES; RANDOM GRAPHS; UNIT BALL;

SOFTWARE ENGINEERING; TENSORS;

GRAPH THEORY;

EID: 80052351392     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. N. Alon, M. Krivelevich and B. Sudakov, Finding a large hidden clique in a random graph, Random Structures and Algorithms 13 (1998) 457-466.
2. N. Alon, M. Krivelevich and V. H. Vu, On the concentration of eigenvalues of random symmetric matrices", Israel Journal of Mathematics 131 (2002) 259-267.
3. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley, (second edition) 2000.
4. U. Feige and R. Krauthgamer, Finding and certifying a large hidden clique in a semirandom graph, Random Structures and Algorithms, 13 (1998) 457-466.
5. 1-ε, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computing, (1997) 627-636.
6. M. Jerrum, Large cliques elude the Metropolis process, Random Structures and Algorithms 3 (1992) 347-359.
7. A. Juels and M. Peinado, Hiding Cliques for Cryptographic Security, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, (1998) 678-684.
8. R. Karp, Reducibility among combinatorial problems, in The complexity of computer computations, R. Miller and J. Thatcher (eds.) Plenum Press, New York (1972) 85-103.
9. R. Karp, The probabilistic analysis of some combinatorial search algorithms, in Algorithms and Complexity: New Directions and Recent Results, J.F. Traub, ed., Academic Press (1976) 1-19.
10. L. Kucera, Expected complexity of graph partitioning problems, Discrete Applied Mathematics 57 (1995) 193-212.
11. F. McSherry, Spectral Partitioning of random graphs, FOCS 2001, 529-537.