ConceptTheory & Algos
Min-st-cut problem
The problem of finding a subset of vertices containing s and excluding t that minimizes the total capacity of edges crossing from the subset to its complement.
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 theory1Optimization problems1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.