Protected: Algorithms for Network Flow Problems
The solution of the maximum communication volume problem by Ford-Fulkerson's algorithm and its relation to the minimum cut problem, the maximum matching problem for nipartite graphs which is a special case of the maximum flow problem, the general matching problem and the minimum cost flow problem are described.