In graph theory, a clique is a fully connected subgraph. A fully connected or complete graph is one wherein every vertex is connected by an edge to every other vertex in the graph.

The clique problem is: given a graph G and an integer k, is there a clique with >= k vertices?

The clique problem has been proven to be np-complete

A Web magazine, situated at, which attempts to give an alternative view of current events, and sometimes pick up some news stories that haven't received media attention.

Note that while many Americans believe it's pronounced klick, it's actually pronounced kleek. Ask anyone in Europe.

Clique (?), n. [F., fr. OF. cliquer to click. See Click, v. i.]

A narrow circle of persons associated by common interests or for the accomplishment of a common purpose; -- generally used in a bad sense.


© Webster 1913.

Clique, v. i.

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


© Webster 1913.

Log in or register to write something here or to contact authors.