AN O(EVLOG2V) ALGORITHM FOR THE MAXIMAL FLOW PROBLEM

被引：36

作者：

GALIL, Z

NAAMAD, A

机构：

来源：

关键词：

D O I：

10.1016/0022-0000(80)90035-5

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：203 / 217

页数：15

共 20 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

[Anonymous], 1970, SOVIET MATH DOKL

[3]

Bent S. W., 1980, 21st Annual Symposium on Foundations of Computer Science, P248, DOI 10.1109/SFCS.1980.15

[4]

Berge C., 1965, PROGRAMMING GAMES TR

[5]

CHERKASKY BV, 1977, MATH METHODS SOLUTIO, V7, P117

EDMONDS, J ;

KARP, RM .

[7]

Ford Jr L. R., 1956, CAN J MATH, V8, P399, DOI [10.4153/CJM-1956-045-5, DOI 10.4153/CJM-1956-045-5]

[8]

Ford Lester R., 1962, FLOWS NETWORKS

[9]

FORD LR, 1956, IRE T INFORMD THEORY, V2, P117

[10]

Galil Z., 1978, 19th Annual Symposium on Foundations of Computer Science, P231, DOI 10.1109/SFCS.1978.5