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 条

[1] PARALLEL ALGORITHMS FOR MINIMUM CUTS AND MAXIMUM FLOWS IN PLANAR NETWORKS.
Johnson, Donald B.
Journal of the ACM, 1987, 34 (04): : 950 - 967
[2] MAXIMUM CONCURRENT FLOWS AND MINIMUM CUTS
CHENG, CK
HU, TC
ALGORITHMICA, 1992, 8 (03) : 233 - 249
[3] Maximum Flows and Minimum Cuts in the Plane
Strang, Gilbert
ADVANCES IN APPLIED MATHEMATICS AND GLOBAL OPTIMIZATION, 2009, 17 : 1 - 11
[4] Maximum flows and minimum cuts in the plane
Gilbert Strang
Journal of Global Optimization, 2010, 47 : 527 - 535
[5] Maximum flows and minimum cuts in the plane
Strang, Gilbert
JOURNAL OF GLOBAL OPTIMIZATION, 2010, 47 (03) : 527 - 535
[6] A NOTE ON FINDING MINIMUM CUTS IN DIRECTED PLANAR NETWORKS BY PARALLEL COMPUTATIONS
JANIGA, L
KOUBEK, V
INFORMATION PROCESSING LETTERS, 1985, 21 (02) : 75 - 78
[7] Sequential and parallel algorithms for minimum flows
Ciurea E.
Ciupalâ L.
Journal of Applied Mathematics and Computing, 2004, 15 (1-2) : 53 - 75
[8] The Maximum Flows in Planar Dynamic Networks
Schiopu, C.
Ciurea, E.
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2016, 11 (02) : 282 - 291
[9] MINIMUM FLOWS IN (S,T) PLANAR NETWORKS
ADLAKHA, V
GLADYSZ, B
KAMBUROWSKI, J
NETWORKS, 1991, 21 (07) : 767 - 773
[10] Maximum Flows in Planar Dynamic Networks with Lower Bounds
Schiopu, Camelia
Ciurea, Eleonor
FUNDAMENTA INFORMATICAE, 2018, 163 (02) : 189 - 204

← 1 2 3 4 5 →