Extreme Min – Cut Max – Flow Algorithm

Abstract

In this article, the authors propose a maximum flow algorithm based on flow matrix. The algorithm only requires the effort to reduce the capacity of the underutilized arcs to that of the respective flow. The optimality of the algorithm is proved by the max-flow min-cut theorem. The algorithm is table-based, thus avoiding augmenting path and residual network concepts. The authors used numerical examples and computational comparisons to demonstrate the efficiency of the algorithm. These examples and comparisons revealed that the proposed algorithm is capable of computing exact solutions while using few iterations as compared to some existing algorithms.