期刊名称:Journal of Computing and Information Technology
印刷版ISSN:1330-1136
电子版ISSN:1846-3908
出版年度:1999
卷号:7
期号:3
页码:237-243
语种:English
出版社:SRCE - Sveučilišni računski centar
摘要:The maximum flow problem has been studied for over forty years. One of the methods for solving this problem is the generic push-relabel algorithm. In this paper we develop a parallel version of this sequential algorithm. Our assumed model of computation is a shared-memory multiprocessor. We describe a concrete implementation of the algorithm based on the PVM package, and present the obtained numerical results.
关键词:network; maximum flow problem; parallel algorithm; PVM; experiment