DMCA
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow Algorithm (1998)
Cached
Download Links
| Venue: | Information Processing Letters |
| Citations: | 8 - 0 self |
BibTeX
@ARTICLE{Cheriyan98ananalysis,
author = {Joseph Cheriyan and Kurt Mehlhorn},
title = {An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow Algorithm},
journal = {Information Processing Letters},
year = {1998},
volume = {69},
pages = {69--239}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Consider the problem of finding a maximum flow in a network. Goldberg and Tarjan introduced the preflow-push method for solving this problem. When this method is implemented with the highest-level selection rule, then both the running time and the number of pushes are known to be O(n 2 # m), where n is the number of nodes and m is the number of edges. We give a new proof based on a potential function argument. Potential function arguments may be preferable for analysing preflow-push algorithms, since they are simple and generic. 1 Introduction Consider the problem of finding a maximum flow in a network. This is one of the most intensively studied combinatorial problems, and finds applications in transportation, communication networks, VLSI design, etc., see [AMO93]. Goldberg and Tarjan [GT88] introduced the preflow-push method for solving this problem. The complexity of this method depends mainly on the number of push operations, and this in turn depends mainly on the selectio...
