A Comparative Study of Algorithms for Maximum Flow Problems

Abstract

The max flow problem means to send as much flow as possible from source to the sink satisfying the following two conditions: the capacity of each edge is greater than or equal to its flow and inflow and outflow are same throughout the network for every node except source and sink. Those problems which are related to maximum flow are called maximum flow problems. The maximum flow problem has its wide applications in real life situation like airline scheduling, communication networks; electrical power etc. Various algorithms are there to solve this problem in the literature. In this paper, we present comparative study of the existing algorithms to maximum flow problem.