Can a maximum flow be computed in o(nm) time?

Authors:
Joseph Cheriyan;Torben Hagerup;Kurt Mehlhorn
Affiliations:
-;-;-
Venue:
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Year:
1990

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
A randomized linear-time algorithm for finding minimum spanning trees

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees

Journal of the ACM (JACM)
A simple min-cut algorithm

Journal of the ACM (JACM)
Experimental study of minimum cut algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A self-stabilizing algorithm for the maximum flow problem

Distributed Computing

Hi-index	0.00