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… 
2010
2010
Concept Representation and Database Structures in Fuzzy Social Relational Networks
  • R. Yager
  • IEEE Transactions on Systems, Man, and…
  • 2010
  • Corpus ID: 10717430
We discuss the idea of fuzzy relationships and their role in modeling weighted social relational networks. The paradigm of… 
Highly Cited
2004
Highly Cited
2004
Approximating maximal cliques in ad-hoc networks
The capacity of an ad-hoc network is severely affected by interference between links, and several efforts to model this effect… 
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… 
2004
2004
Multiclass Discriminative Fields for Parts-Based Object Detection
In this paper, we present a discriminative framework for parts-based object detection based on the multiclass extensions of… 
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… 
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)