Planted clique

In computational complexity theory, a planted clique or hidden clique in an undirected graph is a clique formed from another graph by selecting a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2017
051020012017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We consider a robust analog of the planted clique problem. In this analog, a set S of vertices is chosen and all edges in S are… (More)
  • figure 1
Is this relevant?
2015
2015
We give a lower bound of Ω̃( √ n) for the degree-4 Sum-of-Squares SDP relaxation for the planted clique problem. Specifically, we… (More)
Is this relevant?
2013
2013
We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be… (More)
Is this relevant?
2013
2013
We consider the problem of identifying the densest k-node subgraph in a given graph. We write this problem as an instance of rank… (More)
  • figure 5.1
Is this relevant?
2012
2012
We study the problem of detecting or discovering a planted clique embedded in a random graph. Using recent results from random… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
We develop a framework for proving lower bounds on computational problems over distributions, including optimization and… (More)
Is this relevant?
2012
2012
We introduce a framework for proving lower bounds on computational problems over distributions, for a class of algorithms called… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both… (More)
Is this relevant?
2011
2011
A clique of a graph G is a set of pairwise adjacent nodes of G. Similarly, a biclique<lb>(U, V ) of a bipartite graph G is a pair… (More)
  • table 6.1
  • figure 6.2
  • table 6.2
  • figure 6.2
  • figure 6.2
Is this relevant?
2008
2008
It is well known that finding the largest clique in a graph is NP-hard, [8]. Indeed, Hastad [5] has shown that it is NP-hard to… (More)
Is this relevant?