## A Fast and Simple Algorithm for the Maximum Flow Problem (1989)

Venue: | OPERATIONS RESEARCH |

Citations: | 32 - 6 self |

### BibTeX

@ARTICLE{Ahuja89afast,

author = {R. K. Ahuja and James B. Orlin},

title = {A Fast and Simple Algorithm for the Maximum Flow Problem},

journal = {OPERATIONS RESEARCH},

year = {1989},

volume = {37},

number = {5},

pages = {748--759}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a simple sequential algorithm for the maximum flow problem on a network with n nodes, m arcs, and integer arc capacities bounded by U. Under the practical assumption that U is polynomially bounded in n, our algorithm runs in time O(nm + n 2 log n). This result improves the previous best bound of O(nm log(n 2 /m)), obtained by Goldberg and Taran, by a factor of log n for networks that are both nonsparse and nondense without using any complex data structures. We also describe a parallel implementation of the algorithm that runs in O(n'log U log p) time in the PRAM model with EREW and uses only p processors where p = [m/n