Theoretical efficiency of the algorithm "capacity" for the maximum flow problem

A bad network for capacity -- Convergence

Selected applications of maximum flows and minimum cuts in networks

Basic results -- Finding maximum flows -- Direct applications of maximum flow theory -- Extensions of maximum flow theory -- Direct applications of minimum cuts -- A binary quadratic programming formulation of minimum cuts -- Problems solvable by a sequence of minimum cut problems -- More difficult minimum cut problems