clique problem
Description: The clique problem is a computational graph theory problem of finding a complete subgraph of a specified size or maximum size.
Primary topic: Complexity and Algorithms in Graphs (37%)
Wikidata ID: wiki/Q1196873
OpenAlex ID: keywords/clique-problem
