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 条
  • [41] AN O(N2(M+NLOGN)LOGN) MIN-COST FLOW ALGORITHM
    GALIL, Z
    TARDOS, E
    JOURNAL OF THE ACM, 1988, 35 (02) : 374 - 386
  • [42] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
    KIM, T
    CHWA, KY
    INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
  • [43] A O(nm log(U/n)) time maximum flow algorithm
    Sedeño-Noda, A
    González-Martín, C
    NAVAL RESEARCH LOGISTICS, 2000, 47 (06) : 511 - 520
  • [44] A new parallel improvement algorithm for maximum cut problem
    Xia, GP
    Tang, Z
    Wang, JH
    Wang, RL
    Li, Y
    Xia, G
    ADVANCES IN NEURAL NETWORKS - ISNN 2004, PT 1, 2004, 3173 : 419 - 424
  • [45] A parallel approximation algorithm for the weighted maximum matching problem
    Manne, Fredrik
    Bisseling, Rob H.
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 708 - +
  • [46] An o*(1.4786n)-time algorithm for the maximum induced matching problem
    1600, Springer Science and Business Media Deutschland GmbH (20):
  • [47] AN O(20.304N) ALGORITHM FOR SOLVING MAXIMUM INDEPENDENT SET PROBLEM
    JIAN, T
    IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (09) : 847 - 851
  • [48] Two O(n2) Time Fault-Tolerant Parallel Algorithm for Inter NoC Communication in NiP
    Nitin, D.
    Singh, Chauhan Durg
    Kumar, Sehgal Vivek
    COMPUTER AND INFORMATION SCIENCE, 2008, 131 : 267 - 282
  • [49] An O(N2) Algorithm for Computation of the Minimum Time Consensus
    Mulla, Ameer K.
    Patil, Deepak U.
    Chakraborty, Debraj
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 2638 - 2643
  • [50] AN O(N2) ALGORITHM FOR COLORING PERFECT PLANAR GRAPHS
    TUCKER, A
    WILSON, D
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1984, 5 (01): : 60 - 68
12345