Lecture Discrete Structures for Computing - Chapter 11: Flows. After studying this section will help you understand: motivation, max flow problem, max flow and min cost problem; algorithm state-of-the-art, Ford-Fulkerson’s algorithm for solving max flow problem, Ford-Fulkerson’s algorithm for solving max flow and min, . |