Document Open Access Logo

A new approach to the planted clique problem

Authors Alan Frieze, Ravi Kannan

Thumbnail PDF


  • Filesize: 425 kB
  • 12 pages

Document Identifiers

Author Details

Alan Frieze
Ravi Kannan

Cite AsGet BibTex

Alan Frieze and Ravi Kannan. A new approach to the planted clique problem. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 187-198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)


We study the problem of finding a large planted clique in the random graph $G_{n,1/2}$. We reduce the problem to that of maximising a three dimensional tensor over the unit ball in $n$ dimensions. This latter problem has not been well studied and so we hope that this reduction will eventually lead to an improved solution to the planted clique problem.
  • Planted Clique
  • Tensor
  • Random Graph


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail