An O($n\cdot I \log^2 I$) maximum-flow algorithm

Authors:
Yossi Shiloach
Affiliations:
-
Venue:
An O($n\'cdot I \'log^2 I$) maximum-flow algorithm
Year:
1978

Citing 0
Cited 3

A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A data structure for dynamic trees

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present in this paper a new algorithm to find a maximum flow in a flow-network which has n vertices and m edges in time of O($n\cdot I \log^2 I$), where I = M+n is the input size (up to a constant factor). This result improves the previous upper bound of Z . Galil [1978] which was O($I^{7/3}$) in the worst case.