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.
2013
2013
Simple measure of similarity for the market graph construction
A simple measure of similarity for the construction of the market graph is proposed. The measure is based on the probability of… 
2013
2013
Lovász ϑ function, SVMs and finding dense subgraphs
In this paper we establish that the Lovasz ϑ function on a graph can be restated as a kernel learning problem. We introduce the… 
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
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… 
2008
2008
Type-2 Fuzzy Markov Random Fields and Their Application to Handwritten Chinese Character Recognition
In this paper, we integrate type-2 (T2) fuzzy sets with Markov random fields (MRFs) referred to as T2 FMRFs, which may handle… 
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… 
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… 
1993
1993
Linear Layouts of Generalized Hypercubes
This paper studies linear layouts of generalized hypercubes, a d-dimensional c-ary clique and a d-dimensional c-ary array, and… 
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… 
Review
1985
Review
1985
On the ideals of a Noetherian ring
We construct various examples of Noetherian rings with peculiar ideal structure. For example, there exists a Noetherian domain R… 
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)