Topic: Network Flows and the Max-Flow Min-Cut Theorem

Nontermination with Irrational Capacities

Modeling Capacity-Constrained Flow Networks

Integer Capacities and Ford-Fulkerson Integrality

Ford-Fulkerson on an Explicit Network

Flow Value and Source-Sink Balance

Feasible Flows and Conservation Equations

Extracting a Cut from a Residual Network

Decomposing Flows into Paths and Cycles

Cuts and Their Capacities

Certifying Maximum Flows with Minimum Cuts