Can A Maximum Flow be Computed on o(nm) Time?

@inproceedings{Cheriyan1990CanAM,
  title={Can A Maximum Flow be Computed on o(nm) Time?},
  author={Joseph Cheriyan and Torben Hagerup and Kurt Mehlhorn},
  booktitle={ICALP},
  year={1990}
}
A b s t r a c t. We show that a maximum flow in a network with n vertices can be computed deterministically in O(n3/logn) time on a uniform-cost RAM. For dense graphs, this improves the previous best bound of O(n3). The bottleneck in our algorithm is a combinatorial problem on (unweighted) graphs. The number of operations executed on flow variables is O(nS/3(log n)4/3), in contrast with f~(nm) flow operations for all previous algorithms, where m denotes the number of edges in the network. A… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

SHAW AND J . STAPLES , The Maximum Flow Problem is Log Space Complete for P

A. R.
Theor . Comp . Sci . • 1988

A New Approach to the MaximumFlow Prob

A. V. GOr. DBERG AND R. E. TARJAN
J . ACM

Similar Papers

Loading similar papers…