ConceptTheory & Algos
E-CLIQUE
The language of graph-number pairs where the size of the largest clique in the graph is exactly K.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.