(definition)
Definition: A set of vertices in an undirected graph in which there is an edge between every pair of vertices. In other words, a subgraph that is complete.
Generalization (I am a kind of ...)
complete graph.
See also clique problem.
Note: Standard pronunciation should be "cleek", to rhyme with antique, boutique, critique, oblique, physique, pique, technique, unique, etc.
Definition after Lior Malka, 31 July 2003.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 29 January 2007.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "clique", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 29 January 2007. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/clique.html