TITLE:
Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems
AUTHORS:
Kalyan Kumar Mallick, Aminur Rahman Khan, Mollah Mesbahuddin Ahmed, Md. Shamsul Arefin, Md. Sharif Uddin
KEYWORDS:
Maximum Flow, Maximum Flow Problem, Breadth First Search, Augmenting Path, Residual Network
JOURNAL NAME:
Open Journal of Applied Sciences,
Vol.6 No.2,
February
29,
2016
ABSTRACT: Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.