An O(n2) parallel algorithm for the maximum flow problem

被引：0
|
作者：
Tabirca, S [1 ]
Tabirca, T [1 ]
机构：
[1] Natl Univ Ireland Univ Coll Cork, Dept Comp Sci, BCRI, Cork, Ireland
来源：
Concurrent Information Processing and Computing | 2005年 / 195卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The aim of this article is to present a new parallel algorithm for the maximum flow problem. The algorithm is obtained by using the parallel Divide and Conquer computation for the In-Out Rebalancing Flow method. The complexity of this algorithm is O(n(2)) when a PRAM machine with p = O(m) processors is used.
引用
收藏
页码：294 / 300
页数：7
相关论文
共 50 条
12345