Statement
Min st-cut
Given a flow network
what is the st-cut with minimum capacity.
Solutions
- Ford-Fulkerson Algorithm
where is the min cut. - This is only guaranteed to terminate for integer flows.
Theory
- Max-flow min-cut Theorem
- This says the solutions are the same as the max flow problems.