Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,115,097 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.
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
2012
2012
Compact hashing for mixed image-keyword query over multi-label images
Xianglong Liu
,
Yadong Mu
,
B. Lang
,
Shih-Fu Chang
International Conference on Multimedia Retrieval
2012
Corpus ID: 6086230
Recently locality-sensitive hashing (LSH) algorithms have attracted much attention owing to its empirical success and theoretic…
Expand
Highly Cited
2008
Highly Cited
2008
Large maximal cliques enumeration in sparse graphs
Natwar Modani
,
K. Dey
International Conference on Information and…
2008
Corpus ID: 21912362
Here we study a variant of maximal clique enumeration problem by incorporating a minimum size criterion. We describe…
Expand
Highly Cited
2004
Highly Cited
2004
Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems
Predrag T. Tosic
,
G. Agha
Massively Multi-Agent Systems
2004
Corpus ID: 826934
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main…
Expand
2002
2002
Constraint Propagation in Graph Coloring
M. Caramia
,
P. Dell’Olmo
J. Heuristics
2002
Corpus ID: 3062112
In this paper we propose a method for integrating constraint propagation algorithms into an optimization procedure for vertex…
Expand
1999
1999
Fully dynamic algorithms for chordal graphs
L. Ibarra
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 5270357
We present the fist dynamic algorithm to support the following operations on a chordal graph: (1) test whether deleting or…
Expand
1992
1992
Finding All Solutions if You can Find One
R. Dechter
,
A. Itai
1992
Corpus ID: 16792685
Author(s): Dechter, Rina; Itai, Alon | Abstract: We address the problem of enumerating (producing) all models of a given theory…
Expand
Highly Cited
1992
Highly Cited
1992
A branch and bound algorithm for the maximum clique problem
P. Pardalos
,
G. P. Rodgers
Computers & Operations Research
1992
Corpus ID: 29260498
Highly Cited
1988
Highly Cited
1988
Selection of process plans in automated manufacturing systems
A. Kusiak
,
G. Finke
IEEE J. Robotics Autom.
1988
Corpus ID: 5385866
Most of the planning models for automated manufacturing systems are based on the assumption that for each part there is only one…
Expand
1988
1988
Structural matching for stereo vision
R. Horaud
,
T. Skordas
[ Proceedings] 9th International Conference on…
1988
Corpus ID: 39699111
An approach for solving the stereo correspondence problem is suggested that is based on extracting local image structures and…
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