Author(s)

Kalyan Kumar Mallick¹, Aminur Rahman Khan², Mollah Mesbahuddin Ahmed², Md. Shamsul Arefin³, Md. Sharif Uddin²

¹Department of Mathematics, University of Development Alternative (UODA), Dhaka, Bangladesh.
²Department of Mathematics, Jahangirnagar University, Savar, Dhaka, Bangladesh.
³Department of Computer Science and Engineering, University of Development Alternative (UODA), Dhaka, Bangladesh.

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.

Maximum Flow, Maximum Flow Problem, Breadth First Search, Augmenting Path, Residual Network

Mallick, K. , Khan, A. , Ahmed, M. , Arefin, M. and Uddin, M. (2016) Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems. Open Journal of Applied Sciences, 6, 131-140. doi: 10.4236/ojapps.2016.62014.