Clique problem

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class

Notion

Domain

Science and technology

In collections

1 player has it in their collection.

What Wikipedia says

In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found.

Excerpt from the Wikipedia article “Clique problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Thore Husfeldt, CC BY-SA 3.0, via Wikimedia Commons.