A NEW APPROACH TO THE MAXIMUM-FLOW PROBLEM

被引：1146

作者：

GOLDBERG, AV

TARJAN, RE

机构：

[1] MIT,CAMBRIDGE,MA 02139

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

[3] PRINCETON UNIV,PRINCETON,NJ

来源：

关键词：

D O I：

10.1145/48014.61051

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：921 / 940

页数：20

共 34 条

[1] AHUJA RK, 1987, MIT190587 SLOAN SCH
[2] AHUJA RK, UNPUB IMPROVED TIME
[3] [Anonymous], 1970, SOVIET MATH DOKL
[4] COMPLEXITY OF NETWORK SYNCHRONIZATION
AWERBUCH, B
[J]. JOURNAL OF THE ACM, 1985, 32 (04) : 804 - 823
[5] CHERIYAN J, 1987, ANAL PREFLOW PUSH AL
[6] CHERKASKY RV, 1977, MATH METHODS SOLUTIO, V7, P112
[7] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS
EDMONDS, J
KARP, RM
[J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &
[8] Even S., 1979, GRAPH ALGORITHMS
[9] Ford L., 1962, FLOWS NETWORKS
[10] Ford LR., 1956, CAN J MATH, V8, P399, DOI DOI 10.4153/CJM-1956-045-5