IMPROVED TIME-BOUNDS FOR THE MAXIMUM FLOW PROBLEM

[1] AHUJA RK, UNPUB MATH PROG

[2] AHUJA RK, IN PRESS OPER RES

[3] CHERIYAN J, 1987, ANAL PREFLOW PUSH AL

[4] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[5] Even S., 1979, GRAPH ALGORITHMS

[6] Ford L., 1962, FLOWS NETWORKS

[7] GABOW HN, 1985, J COMPUT SYST SCI, V31, P148, DOI 10.1016/0022-0000(85)90039-X

[8] A NEW APPROACH TO THE MAXIMUM-FLOW PROBLEM [J]. JOURNAL OF THE ACM, 1988, 35 (04) : 921 - 940

[9] GOLDBERG AV, 1985, MITLCSTM291 LAB COMP

[10] GOLDBERG AV, IN PRESS MATH OPER R

[1] AHUJA RK, UNPUB MATH PROG

[2] AHUJA RK, IN PRESS OPER RES

[3] CHERIYAN J, 1987, ANAL PREFLOW PUSH AL

[4] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[5] Even S., 1979, GRAPH ALGORITHMS

[6] Ford L., 1962, FLOWS NETWORKS

[7] GABOW HN, 1985, J COMPUT SYST SCI, V31, P148, DOI 10.1016/0022-0000(85)90039-X

[8] A NEW APPROACH TO THE MAXIMUM-FLOW PROBLEM [J]. JOURNAL OF THE ACM, 1988, 35 (04) : 921 - 940

[9] GOLDBERG AV, 1985, MITLCSTM291 LAB COMP

[10] GOLDBERG AV, IN PRESS MATH OPER R