NIST

clique problem

(classic problem)

Definition: Find the largest clique in an undirected graph.

Author: PEB

Implementation

(Fortran, C, and Mathematica)
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 2 September 2014.
HTML page formatted Mon May 11 15:07:56 2026.

Cite this as:
Paul E. Black, "clique problem", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: /HTML/cliqueproblm.html