ConceptTheory & Algos
Min-bisection
An NP-hard graph problem where the goal is to partition the vertices into two sets of equal size so as to minimize the number of edges between them.
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.
Graph theory1NP-hardness1
Lecturers
1Connections
1The lectures that define it or assume it, and the concepts next to it.