Analysis and Optimization of Max Flow Min-cut

Abstract

Today we are working with the networks all around and that's why it becomes very important to find the effective flow of the commodity within that network. This paper aims to provide an analysis of the best known algorithm for calculating maximum flow of any network and to propose an approximate algorithm, which can solve the same problem with lesser complexity, desirably lesser than the complexity of the known Stoer-Wagner algorithm. This paper addresses this problem with a new approach, which uses upper bound values of each node in the network.Results are compared with fixed number of nodes and variable number of nodes in the network. Moreover networks with variable densities are also considered. Results are obtained by programming the both algorithms in C++.Unix scripts are also used for formatting the results.