A faster deterministic maximum flow algorithm

Authors:
V. King;S. Rao;R. Tarjan
Affiliations:
-;-;-
Venue:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 3
Cited 8

A new approach to the maximum-flow problem

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

Journal of Computer and System Sciences
Network flows

Optimization

Approximate decision algorithms for point set congruence

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Online load balancing and network flow

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Path independence for authentication in large-scale systems

Proceedings of the 4th ACM conference on Computer and communications security
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Resilient Authentication Using Path Independence

IEEE Transactions on Computers
Authentication metric analysis and design

ACM Transactions on Information and System Security (TISSEC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a deterministic version of a 1990 Cheriyan, Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow on a directed graph with n nodes and m edges which runs in time O(mn + n2+&egr;, for any constant &egr;. This improves upon Alon's 1989 bound of O(mn + n8/3log n) [A] and gives an O(mn) deterministic algorithm for all m n1+&egr;. Thus it extends the range of m/n for which an O(mn) algorithm is known, and matches the 1988 algorithm of Goldberg and Tarjan [GT] for smaller values of m/n.