Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01837870n
Noun Concept
Categories: NP-complete problems, Computational problems in graph theory
EN
clique problem  Approximation algorithms for the clique problem  K-clique problem  maximum clique problem
EN
In computer science, the clique problem is the computational problem of finding cliques in a graph. Wikipedia
Definitions
Relations
Sources
EN
In computer science, the clique problem is the computational problem of finding cliques in a graph. Wikipedia
Computational problem of finding cliques in a graph Wikidata
IS A
computational problem
PART OF
Karp's 21 NP-complete problems
HAS KIND
maximum independent set problem
OPPOSITE OF
maximum independent set problem
Wikipedia
EN
clique problem
Wikidata
EN
clique problem
Wikipedia Redirections
EN
Approximation algorithms for the clique problem, K-clique problem, maximum clique problem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License