| Sumario: | The article discusses basic techniques concerning maximum flow algorithms that have applications in science and engineering. Topics addressed include distinctions between polynomial and strongly polynomial flow algorithms, polynomial-time algorithms resulting from the idea of augmenting along the shortest paths, and faster algorithms developed from data structures and fine-grain operations. Also mentioned are improving time bounds by discriminating on the basis of residual capacities when allocating arc lengths, descriptions of intuitive algorithms, and preflows used in the push-relabel method.
|
|---|