Clique problem

Known as: K-clique problem, Maximum clique problem 
In computer science, the clique problem is any of a number of computational problems of finding cliques (subsets of vertices, all adjacent to each… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2018
0204019782018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A new algorithm for finding a maximum clique in an undirected graph is described. An approximate coloring algorithm has been… (More)
  • figure 3
  • table 1
  • table 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates… (More)
  • figure 2
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Estimation of distribution algorithms sample new solutions (offspring) from a probability model which characterizes the… (More)
  • figure 1
  • figure 2
  • table II
  • table III
Is this relevant?
2003
2003
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A new Reactive Local Search (\RLS ) algorithm is proposed for the solution of the Maximum-Clique problem. \RLS is based on local… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present an approach for clique and quasi-clique computations in very large multi-digraphs. We discuss graph decomposition… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Review
1994
Review
1994
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A method to solve the maximum clique problem based on an unconstmin~ quadratic zero-one programming fo~ulation is presented. A… (More)
  • figure I
  • table 1
  • table 2
  • table 3
Is this relevant?