APPLICATION OF MAX-FLOW MIN-CUT THEOREM IN BIPARTITE GRAPHS TO OBTAIN MAXIMUM FLOW

Abstract

The Max-Flow Min-Cut Theorem is the most efficient result which can be used to determine the maximum value of flow by minimum value of capacities of all the cut sets in the network flows. In this paper we show that this theorem implies the some important results for bipartite graphs to obtain maximum flow in graph theory.

Keywords Network flow, Augmenting path, Maximum flow, Minimum cut, Maximum matching, Minimum  covering, Bipartite  graph.