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.
2015
2015
Discrete Tabu Search for Graph Matching
Graph matching is a fundamental problem in computer vision. In this paper, we propose a novel graph matching algorithm based on… 
Highly Cited
2010
Highly Cited
2010
Optimal exchange of packets for universal recovery in broadcast networks
Consider an arbitrarily connected broadcast network of N nodes that all wish to recover k desired packets. Each node begins with… 
Highly Cited
2007
Highly Cited
2007
Graph Decomposition for Efficient Multi-Robot Path Planning
In my previous paper (Ryan, 2006) I introduced the concept of subgraph decomposition as a means of reducing the search space in… 
2007
2007
Using Trust Metric to Detect Malicious Behaviors in WSNs
In order to enhance transaction security in wireless sensor networks, it is important to evaluate nodes' trustworthiness… 
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… 
Highly Cited
1996
Highly Cited
1996
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
The linear programming relaxation of the minimum vertex coloring problem, called the fractional coloring problem, is NP-hard. We… 
Highly Cited
1993
Highly Cited
1993
Test case generators and computational results for the maximum clique problem
In the last years many algorithms have been proposed for solving the maximum clique problem. Most of these algorithms have been… 
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)