Year: 2016
Type: article
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.
Source: Open Journal of Applied Sciences
Authors: Kalyan Kumar Mallick, Aminur Rahman Khan, Mollah Mesbahuddin Ahmed, Md. Shamsul Arefin, Md. Sharif Uddin
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $299
OpenAlex ID: W2286921448
