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)

Related topics

Related topics

50 relations
Albertson conjectureAntimatroidBioinformaticsBron–Kerbosch algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structural sparseness and complex networks
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2012
2012
Compact hashing for mixed image-keyword query over multi-label images
Recently locality-sensitive hashing (LSH) algorithms have attracted much attention owing to its empirical success and theoretic… 
Highly Cited
2008
Highly Cited
2008
Large maximal cliques enumeration in sparse graphs
Here we study a variant of maximal clique enumeration problem by incorporating a minimum size criterion. We describe… 
Highly Cited
2004
Highly Cited
2004
Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main… 
2002
2002
Constraint Propagation in Graph Coloring
In this paper we propose a method for integrating constraint propagation algorithms into an optimization procedure for vertex… 
1999
1999
Fully dynamic algorithms for chordal graphs
We present the fist dynamic algorithm to support the following operations on a chordal graph: (1) test whether deleting or… 
Highly Cited
1992
Highly Cited
1992
A branch and bound algorithm for the maximum clique problem
1992
1992
Finding All Solutions if You can Find One
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
Selection of process plans in automated manufacturing systems
Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one… 
1988
1988
Structural matching for stereo vision
An approach for solving the stereo correspondence problem is suggested that is based on extracting local image structures and… 
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)