## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Andrew V Goldberg; Michael D Grigoriadis; Robert E Tarjan; Stanford University. Computer Science Department. |

OCLC Number: | 20257481 |

Notes: | "February 1989." |

Description: | 17 pages : illustrations ; 28 cm. |

Series Title: | Report (Stanford University. Computer Science Department), no. STAN-CS-89-1248. |

Responsibility: | Andrew V. Goldberg, Michael D. Grigoriadis, Robert E. Tarjan. |

### Abstract:

Goldfarb and Hao have proposed a network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(n2m) time. In this paper we describe how to implement their algorithm to run in O(nm log n) time by using an extension of the dynamic tree data structure of Sleator and Tarjan. This bound is less than a logarithmic factor larger than that of any other known algorithm for the problem.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Efficiency of the network simplex algorithm for the maximum flow problem".
Be the first.