Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,730 papers from all fields of science
Search
Sign In
Create Free Account
Clique (graph theory)
Known as:
Clique (disambiguation)
, K-clique
, Maximum clique
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Albertson conjecture
Antimatroid
Bioinformatics
Bron–Kerbosch algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
1996
Review
1996
The kindness of strangers: on the usefulness of electronic weak ties for technical advice
David Constant
,
L. Sproull
,
S. Kiesler
1996
Corpus ID: 3483402
People use weak ties---relationships with acquaintances or strangers---to seek help unavailable from friends or colleagues. Yet…
Expand
Review
1995
Review
1995
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
F. Alizadeh
SIAM Journal on Optimization
1995
Corpus ID: 719304
This paper studies the semidefinite programming SDP problem, i.e., the optimization problem of a linear function of a symmetric…
Expand
Highly Cited
1992
Highly Cited
1992
Proof verification and hardness of approximation problems
Sanjeev Arora
,
C. Lund
,
R. Motwani
,
M. Sudan
,
M. Szegedy
Proceedings., 33rd Annual Symposium on…
1992
Corpus ID: 1839006
The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that…
Expand
Highly Cited
1991
Highly Cited
1991
Unit disk graphs
Brent N. Clark
,
C. Colbourn
,
David S. Johnson
Discrete Mathematics
1991
Corpus ID: 35758744
Highly Cited
1986
Highly Cited
1986
The complexity of optimization problems
Mark W. Krentel
Symposium on the Theory of Computing
1986
Corpus ID: 9900543
We study computational complexity theory and define a class of optimization problems called OptP (Optimization Polynomial Time…
Expand
Highly Cited
1977
Highly Cited
1977
Contentment in graph theory: Covering graphs with cliques
J. Orlin
1977
Corpus ID: 122604700
Highly Cited
1976
Highly Cited
1976
An Algorithm for Subgraph Isomorphism
J. Ullmann
Journal of the ACM
1976
Corpus ID: 17268751
Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm…
Expand
Highly Cited
1973
Highly Cited
1973
A graph‐theoretic definition of a sociometric clique†
R. Alba
1973
Corpus ID: 14317727
The intent of this paper is to provide a definition of a socioraetric clique in the language of graph theory. This problem is…
Expand
Highly Cited
1973
Highly Cited
1973
Algorithm 457: finding all cliques of an undirected graph
C. Bron
,
J. Kerbosch
1973
Corpus ID: 13886709
Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete…
Expand
Highly Cited
1965
Highly Cited
1965
On cliques in graphs
J. Moon
,
L. Moser
1965
Corpus ID: 9855414
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE