A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
A data structure for dynamic trees
Journal of Computer and System Sciences
Network programming
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A new algorithm for the maximal flow problem
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
| Hi-index | 0.98 |
A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. The algorithm belongs to the so called phase algorithms, and is applied to Dinic-type layered networks. With an effort of at most O(n^3) for maximum value flow, the algorithm ties with the fastest maximum flow algorithms in dense networks, where m ~ n^2, and can therefore be seen as a significant alternate technique. The algorithm is based on the Karzanov [1] algorithm, and shares features with the algorithm of Tarjan [2]. The first version of this algorithm was presented by the author in [3].