Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
We introduce a framework for proving lower bounds on computational problems over distributions against algorithms that can be… Expand
Is this relevant?
Highly Cited
2016
Highly Cited
2016
We prove that with high probability over the choice of a random graph G from the Erdös-Rényi distribution G(n,1/2), the nO(d… Expand
Is this relevant?
2016
2016
The problem of finding large cliques in random graphs and its “planted” variant, where one wants to recover a clique of size… Expand
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d… Expand
  • table 1
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Numerous graph mining applications rely on detecting subgraphs which are large near-cliques. Since formulations that are geared… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Abstract Floating treatment wetlands planted with emergent macrophytes (FTWs) provide an innovative option for treating urban… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Maximal clique enumeration is a fundamental problem in graph theory and has important applications in many areas such as social… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract.Root growth is critical to the establishment of planted seedlings. Seedlings can undergo stress just after planting if… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?