ConceptTheory & Algos
4-Clique
The problem of determining whether an undirected graph contains four vertices with all edges between them present.
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.
3-Clique1Brute force search1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.