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 条
  • [41] PARALLEL ALGORITHMS FOR PLANAR DOMINANCE COUNTING
    KIM, SK
    [J]. PARALLEL COMPUTING, 1990, 15 (1-3) : 241 - 246
  • [42] OPTIMAL PARALLEL ALGORITHMS ON PLANAR GRAPHS
    HAGERUP, T
    [J]. INFORMATION AND COMPUTATION, 1990, 84 (01) : 71 - 96
  • [43] OPTIMAL PARALLEL ALGORITHMS ON PLANAR GRAPHS
    HAGERUP, T
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 24 - 32
  • [44] Polynomial algorithms for (integral) maximum two-flows in vertex/edge-capacitated planar graphs
    Granot, F
    Penn, M
    [J]. DISCRETE APPLIED MATHEMATICS, 1996, 70 (03) : 267 - 283
  • [45] Achieving Minimum-Routing-Cost Maximum-Flows in Infrastructure Wireless Mesh Networks
    Szymanski, T. H.
    [J]. 2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2012,
  • [46] Lattices and Maximum Flow Algorithms in Planar Graphs
    Matuschke, Jannik
    Peis, Britta
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 324 - 335
  • [47] Application of novel constrained optimization algorithms to the minimum volume design of planar CHS trusses with parallel chords
    Jármai, K
    Snyman, JA
    Farkas, J
    [J]. ENGINEERING OPTIMIZATION, 2004, 36 (04) : 457 - 471
  • [48] Modes and cuts in metabolic networks: Complexity and algorithms
    Acuna, Vicente
    Chierichetti, Flavio
    Lacroix, Vincent
    Marchetti-Spaccamela, Alberto
    Sagot, Marie-France
    Stougie, Leen
    [J]. BIOSYSTEMS, 2009, 95 (01) : 51 - 60
  • [49] Communication-Avoiding Parallel Minimum Cuts and Connected Components
    Gianinazzi, Lukas
    Kalvoda, Pavel
    De Palma, Alessandro
    Besta, Maciej
    Hoefler, Torsten
    [J]. ACM SIGPLAN NOTICES, 2018, 53 (01) : 219 - 232
  • [50] MINIMUM CUT IN DIRECTED PLANAR NETWORKS
    JANIGA, L
    KOUBEK, V
    [J]. KYBERNETIKA, 1992, 28 (01) : 37 - 49
12345