CLIQUE

Clique

In the mathematical area of graph theory, a clique in an undirected graph is a subset of its vertices such that every two vertices in the subset are connected by an edge. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Cliques have also been studied in computer science: the task of finding whether there is a clique of a given size in a graph is NP-complete, but despite this hardness result many algorithms for finding cliques have been studied.

The above text is a snippet from Wikipedia: Clique (graph theory)
and as such is available under the Creative Commons Attribution/Share-Alike License.

clique

Noun

  1. A small, exclusive group of individuals; cabal
    This school used to be really friendly, but now everyone keeps to their own cliques.
  2. A subgraph isomorphic to a complete graph.
    The problem of finding the largest clique in an arbitrary graph is NP-complete.
  3. A group of related web sites that link to each other, like a webring but with exclusive membership determined by the clique owner.

Verb

  1. To associate together in a clannish way; to act with others secretly to gain a desired end; to plot.


The above text is a snippet from Wiktionary: clique
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!