A PARALLEL ALGORITHM FOR FINDING A BLOCKING FLOW IN AN ACYCLIC NETWORK

被引：11

作者：

GOLDBERG, AV

TARJAN, RE

机构：

[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

[2] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

[3] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

INFORMATION PROCESSING LETTERS | 1989年 / 31卷 / 05期

关键词：

D O I：

10.1016/0020-0190(89)90084-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：265 / 271

页数：7

共 25 条

[1]

[Anonymous], 1970, SOVIET MATH DOKL

[2]

CHERIYAN J, 1987, UNPUB ANAL PREFLOW P

[3]

CHERKASKY RV, 1977, MATH METHODS SOLUTIO, V7, P112

[4] TERMINATION DETECTION FOR DIFFUSING COMPUTATIONS [J].

DIJKSTRA, EW ;

SCHOLTEN, CS .

INFORMATION PROCESSING LETTERS, 1980, 11 (01) :1-4

[5]

DRISCOLL JR, 1989, J COMPUT SYST SCI, V38, P84

[6] AN O(V5/3E2/3) ALGORITHM FOR THE MAXIMAL FLOW PROBLEM [J].

GALIL, Z .

ACTA INFORMATICA, 1980, 14 (03) :221-242

[7] AN O(EVLOG2V) ALGORITHM FOR THE MAXIMAL FLOW PROBLEM [J].

GALIL, Z ;

NAAMAD, A .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 21 (02) :203-217

[8] A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING-TREES [J].

GALLAGER, RG ;

HUMBLET, PA ;

SPIRA, PM .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1983, 5 (01) :66-77

[9]

Goldberg A.V., 1987, THESIS MASSACHUSETTS

[10]

GOLDBERG AV, 1985, MITLCSTM291 LAB COMP

← 1 2 3 →