%0 Journal Article
%T Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems
%A Kalyan Kumar Mallick
%A Aminur Rahman Khan
%A Mollah Mesbahuddin Ahmed
%A Md. Shamsul Arefin
%A Md. Sharif Uddin
%J Open Journal of Applied Sciences
%P 131-140
%@ 2165-3925
%D 2016
%I Scientific Research Publishing
%R 10.4236/ojapps.2016.62014
%X 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.
%K Maximum Flow
%K Maximum Flow Problem
%K Breadth First Search
%K Augmenting Path
%K Residual  Network
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=64048