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.
2016
2016
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2012
2012
Recently locality-sensitive hashing (LSH) algorithms have attracted much attention owing to its empirical success and theoretic… 
Highly Cited
2008
Highly Cited
2008
Here we study a variant of maximal clique enumeration problem by incorporating a minimum size criterion. We describe… 
Highly Cited
2004
Highly Cited
2004
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main… 
2002
2002
In this paper we propose a method for integrating constraint propagation algorithms into an optimization procedure for vertex… 
1999
1999
We present the fist dynamic algorithm to support the following operations on a chordal graph: (1) test whether deleting or… 
1992
1992
Author(s): Dechter, Rina; Itai, Alon | Abstract: We address the problem of enumerating (producing) all models of a given theory… 
Highly Cited
1988
Highly Cited
1988
Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one… 
1988
1988
An approach for solving the stereo correspondence problem is suggested that is based on extracting local image structures and…