Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
1996
Review
1996
People use weak ties---relationships with acquaintances or strangers---to seek help unavailable from friends or colleagues. Yet… 
Review
1995
Review
1995
This paper studies the semidefinite programming SDP problem, i.e., the optimization problem of a linear function of a symmetric… 
Highly Cited
1992
Highly Cited
1992
The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that… 
Highly Cited
1991
Highly Cited
1986
Highly Cited
1986
We study computational complexity theory and define a class of optimization problems called OptP (Optimization Polynomial Time… 
Highly Cited
1977
Highly Cited
1976
Highly Cited
1976
Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm… 
Highly Cited
1973
Highly Cited
1973
The intent of this paper is to provide a definition of a socioraetric clique in the language of graph theory. This problem is… 
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… 
Highly Cited
1965
Highly Cited
1965
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined…