Editing Clique (graph theory) (section)

==Computer science==
{{Main|Clique problem}}
In [[computer science]], the [[clique problem]] is the computational problem of finding a maximum clique, or all cliques, in a given graph. It is [[NP-complete]], one of [[Karp's 21 NP-complete problems]].{{sfnp|Karp|1972}} It is also [[parameterized complexity|fixed-parameter intractable]], and [[Hardness of approximation|hard to approximate]]. Nevertheless, many [[algorithm]]s for computing cliques have been developed, either running in [[exponential time]] (such as the [[Bron–Kerbosch algorithm]]) or specialized to graph families such as [[planar graph]]s or [[perfect graph]]s for which the problem can be solved in [[polynomial time]].