Maximum Network Flow Algorithms

Abstract

The aim of the maximum network flow problem is to push as much flow as possible between two special vertices, the source and the sink satisfying the capacity constraints. For the solution of the maximum flow problem, there exists a number of algorithms. The existing algorithms can be divided into two families. First, augmenting path algorithms that satisfy the conservation constraints at intermediate vertices and the second preflow push relabel algorithms that violates the conservation constraints at the intermediate vertices resulting incoming flow more than outgoing flow.In this paper, we study different algorithms that determine the maximum flow in the static and dynamic networks.