期刊名称：International Journal of Electronics and Computer Science Engineering
电子版ISSN：2277-1956
出版年度：2013
卷号：2
期号：3
页码：903-911
出版社：Buldanshahr : IJECSE
摘要：Maximum flow problem is a fundamental network flow problem which involves finding a feasible and optimal flow in network consisting of single source and single sink. It has wide ranges of research and commercial applications. Many sequential algorithms such as Ford-Fulkerson algorithm, Edmonds-Karp algorithm, Goldberg’s “generic” maximum flow algorithm, ϵ-relaxation algorithm have been designed to solve this problem. In this paper, we present parallel implementation of ϵ-relaxation algorithm which has been carried out over a cluster consisting of 1 master and 4 slaves nodes in order to study and improve the efficiency of solving maximum flow problem on multi-computer architecture.
