Clique (graph theory)

Known as: Clique (disambiguation), K-clique, Maximum clique 
In the mathematical area of graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that its induced… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
We modify an algorithm of Bron and Kerbosch [1973] for maximal clique enumeration to choose more carefully the order in which the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
UNLABELLED Most cellular tasks are performed not by individual proteins, but by groups of functionally associated proteins, often… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We describe techniques that are useful for the detection of dense subgraphs (quasi-cliques) in massive sparse graphs whose vertex… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We consider the following probabilistic model of a graph on n labeled vertices. First choose a random graph G(n, 1/2) and then… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
  • Béla Bollobás, P. Erdös
  • 1976
1. Introduction. Let 0 < p < 1 be fixed and denote by G a random graph with point set N, the set of natural numbers, such that… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete… (More)
  • figure 2
  • figure 2
Is this relevant?
Highly Cited
1973
Highly Cited
1973
  • Richard D. Alba
  • 1973
The intent of this paper is to provide a definition of a sociometric clique in the language of graph theory. This problem is… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1965
Highly Cited
1965
  • J. W. Moon, L. Moser
  • 1965
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph with n nodes is determined… (More)
  • figure 1
Is this relevant?