maximum clique problem
Description: The maximum clique problem is a computational graph problem that seeks the largest set of vertices in which every pair is connected.
Primary topic: Complexity and Algorithms in Graphs (25%)
Wikidata ID: wiki/Q1196873
OpenAlex ID: keywords/maximum-clique-problem
