ConceptTheory & Algos
Max-cut problem
A graph problem where the goal is to partition the vertices into two sets to maximize the number of edges between the sets.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
6The lectures that define it or assume it, and the concepts next to it.