A FAST PARAMETRIC MAXIMUM FLOW ALGORITHM AND APPLICATIONS

被引：384

作者：

GALLO, G

GRIGORIADIS, MD

TARJAN, RE

机构：

[1] RUTGERS STATE UNIV,DEPT COMP SCI,NEW BRUNSWICK,NJ 08903

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

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

来源：

关键词：

D O I：

10.1137/0218003

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：30 / 55

页数：26

共 46 条

[1] AHUJA RK, 1987, MIT190587 SLOAN SCH
[2] [Anonymous], 1970, SOVIET MATH DOKL
[3] SELECTION PROBLEM
BALINSKI, ML
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03): : 230 - 231
[4] SHARING PROBLEM
BROWN, JR
[J]. OPERATIONS RESEARCH, 1979, 27 (02) : 324 - 340
[5] CAHILLOU P, 1983, IN PRESS LECTURE NOT
[6] OPTIMAL ATTACK AND REINFORCEMENT OF A NETWORK
CUNNINGHAM, WH
[J]. JOURNAL OF THE ACM, 1985, 32 (03) : 549 - 561
[7] Dinkelbach W., 1967, MANAGE SCI, V13, P492, DOI DOI 10.1287/MNSC.13.7.492
[8] MINIMUM PARTITION OF A MATROID INTO INDEPENDENT SUBSETS
EDMONDS, J
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 67 - +
[9] MATHEMATICAL TECHNIQUES FOR EFFICIENT RECORD SEGMENTATION IN LARGE SHARED DATABASES
EISNER, MJ
SEVERANCE, DG
[J]. JOURNAL OF THE ACM, 1976, 23 (04) : 619 - 635
[10] Ford L. R.., 1962, FLOWS NETWORKS