PARALLEL ALGORITHMS FOR MINIMUM CUTS AND MAXIMUM FLOWS IN PLANAR NETWORKS

被引：22
|
作者：
JOHNSON, DB
机构：
来源：
JOURNAL OF THE ACM | 1987年 / 34卷 / 04期
关键词：
D O I：
10.1145/31846.31849
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：950 / 967
页数：18
相关论文
共 50 条
  • [21] PARALLEL MINIMUM SPANNING FOREST ALGORITHMS ON THE STAR AND PANCAKE INTERCONNECTION NETWORKS
    AKL, SG
    QIU, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 634 : 565 - 570
  • [22] SELECTED APPLICATIONS OF MINIMUM CUTS IN NETWORKS
    PICARD, JC
    QUEYRANNE, M
    INFOR, 1982, 20 (04) : 394 - 422
  • [23] FREQUENCY-DOMAIN ANALYSIS FOR MAXIMUM AND MINIMUM FLOWS OF STOCHASTIC TRANSPORTATION NETWORKS
    Zheng, Long
    Zhou, Jinglun
    Sunb, Quan
    Yuan, Mingxuan
    TRANSPORTATION AND MANAGEMENT SCIENCE, 2008, : 31 - +
  • [24] Minimum Flows in Directed Planar Dynamic
    Ciurea, Eleonor
    Schiopu, Camelia
    2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019), 2019, : 1746 - 1751
  • [25] MINIMUM FLOW VARIATION IN MAXIMUM FLOWS
    Masoumi, M.
    Mobasseri, A. M.
    Rezaei, A. R.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2010, 2 (03) : 389 - 393
  • [26] Computing maximum flows in undirected planar networks with both edge and vertex capacities
    Zhang, Xianchao
    Liang, Weifa
    Chen, Guoliang
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, 5092 : 577 - +
  • [27] MULTICOMMODITY FLOWS AND CUTS IN POLYMATROIDAL NETWORKS
    Chekuri, Chandra
    Kannan, Sreeram
    Raja, Adnan
    Viswanath, Pramod
    SIAM JOURNAL ON COMPUTING, 2015, 44 (04) : 912 - 943
  • [28] Revisiting parametric multi-terminal problems:: Maximum flows, minimum cuts and cut-tree computations
    Barth, D.
    Berthome, P.
    Diallo, M.
    Ferreira, A.
    DISCRETE OPTIMIZATION, 2006, 3 (03) : 195 - 205
  • [29] Fast algorithms for even/odd minimum cuts and generalizations
    Benczúr, András A.
    Fiilõp, Ottilia
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1879 : 88 - 99
  • [30] Minimum flows in directed s-t planar networks with arcs and nodes capacities
    Ciurea, Eleonor
    Georgescu, Oana
    Schiopu, Camelia
    2018 5TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2018, : 110 - 115
12345