Modified EDMONDS-KARP Algorithm to Solve Maximum Flow ProblemsReportar como inadecuado




Modified EDMONDS-KARP Algorithm to Solve Maximum Flow Problems - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

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.

KEYWORDS

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

Cite this paper

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.





Autor: Kalyan Kumar Mallick1, Aminur Rahman Khan2, Mollah Mesbahuddin Ahmed2, Md. Shamsul Arefin3, Md. Sharif Uddin2

Fuente: http://www.scirp.org/



DESCARGAR PDF




Documentos relacionados