Finding Hidden Cliques in Linear Time with High Probability

We are given a graph G with n vertices, where a random subset of k vertices has been made into a clique, and the remaining edges are chosen independently with probability $\frac12$. This random graph model is denoted $G(n,\frac12,k)$. The hidden clique problem is to design an algorithm that finds th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Combinatorics, probability & computing Jg. 23; H. 1; S. 29 - 49
Hauptverfasser:	DEKEL, YAEL, GUREL-GUREVICH, ORI, PERES, YUVAL
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.01.2014
Schlagworte:	Algorithms Combinatorial analysis Computation Design engineering Graphs Polynomials Running Spectra 68W20 Primary 05C80 Secondary 05C85
ISSN:	0963-5483, 1469-2163
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!