related to history · 24Clique problem → Also, But, Cook, Erdős, Feige, For, Harary, In, Karp, Luce, Many, NP, NP-completeness, Perry, Ramsey, Ross, See, Since, Social, Szekeres
related to NP-completeness · 21Clique problem → Because, Boolean, CNF, Cook, From, If, It, Karp, Karp's NP-completeness, Levin, NP-complete, NP-hard, Reducibility Among Combinatorial Problems, Richard Karp's, Satisfiability, Stephen Cook's, That, The, Therefore, This
related to Hardness of approximation · 17Clique problem → After, An, Boolean, Depending, False, For, Garey, However, If, In, Johnson, NP, NP-complete, NP-hard, The, They, Weak
related to Finding maximum cliques in arbitrary graphs · 15Clique problem → Bron, DIMACS, DNA, However, It, Jian, Kerbosch, Non-standard, Robson, Robson's, Tarjan, The, There, These, Trojanowski
related to Fixed-parameter intractability · 12Clique problem → Although, Because, Cook, Downey, Fellows, For, Levin, Moreover, Parameterized, That, They, Thus
related to Special classes of graphs · 11Clique problem → Conversely, Even, For, However, In, Kuratowski's, Kőnig's, Lempel, Perfect, Planar, Pnueli
related to Approximation algorithms · 7Clique problem → Although, Boppana, By, Feige, Halldórsson, Several, The
related to Circuit complexity · 6Clique problem → Additionally, Because, Even, However, NOT, The
is a · 2Clique problem → computational problem of finding cliques, special case in which all weights are equal
