Skip to search formSkip to main contentSkip to account menu

Clique problem

Known as: Clique (disambiguation), 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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Aanderaa–Karp–Rosenberg conjectureAlgorithmicaBacktrackingBioinformatics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
The influence of neighborhood density (and neighborhood frequency) in Spanish speech production: A follow-up report
This research was supported in part by grants from the National Institutes of Health to the University of Kansas through the… 
2008
2008
Turbulent Boundary Layer Separation and Control
Boundary layer separation is an unwanted phenomenon in most technical applications, as for instance on airplane wings, ground… 
2006
2006
Rugby Player Migration from New Zealand to Japan
Within an increasingly global sporting economy scholars continue to investigate and map the migration patterns of elite athletes… 
Highly Cited
2005
Highly Cited
2005
The fading number and degrees of freedom in non-coherent MIMO fading channels: a peace pipe
New non-asymptotic upper bounds on the capacity of non-coherent multiple-input multiple-output (MIMO) Gaussian fading channels… 
2005
2005
Degrees of Freedom in Non-Coherent Stationary MIMO Fading Channels
New non-asymptotic upper bounds on the capacity of non-coherent multiple-input multiple-output (MIMO) Gaussian fading chan- nels… 
2002
2002
On the Application and Interpretation of Learning Models
Recent research in experimental economics suggests that simple models of learning can have nontrivial practical implications. For… 
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
1991
1991
Modélisation et simulation de l'architecture de l'orme du Japon Zelkova serrata (Thunb.) Makino (Ulmaceae) : la notion d'axe de référence
L'analyse architecturale et quantitative de plusieurs individus de Zelkova serrata âges de 1 a 100 ans et poussant dans des… 
1990
1990
Experiments for isolated-word recognition with single- and two-layer perceptrons
1985
1985
Sublattices of the Polynomial Time Degrees
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)