License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2008.1752
URN: urn:nbn:de:0030-drops-17521
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1752/
Go to the corresponding LIPIcs Volume Portal

Frieze, Alan ; Kannan, Ravi

A new approach to the planted clique problem

pdf-format:
08004.FriezeAlan.1752.pdf (0.4 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{frieze_et_al:LIPIcs:2008:1752,
  author =	{Alan Frieze and Ravi Kannan},
  title =	{{A new approach to the planted clique problem}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{187--198},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-08-8},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{2},
  editor =	{Ramesh Hariharan and Madhavan Mukund and V Vinay},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1752},
  URN =		{urn:nbn:de:0030-drops-17521},
  doi =		{10.4230/LIPIcs.FSTTCS.2008.1752},
  annote =	{Keywords: Planted Clique, Tensor, Random Graph}
}

Keywords: Planted Clique, Tensor, Random Graph
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Issue Date: 2008
Date of publication: 05.12.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI