论文信息 - A new algorithm for the maximal flow problem

A new algorithm for the maximal flow problem

A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2.33) where n = V + E is the length of the input.

Zvi Galil | Z. Galil

[1] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[2] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[3] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[5] A. V. Karzanov,et al. Determining the maximal flow in a network by the method of preflows , 1974 .