A new approach to the maximum-flow problem
Authors
Discussion
Loading...
Member takes
Implication
Randomized trial introduces a maximum-flow method using preflow in dense graphs, suggesting faster performance.
Key Points
- This research aims to present a new method for solving the maximum-flow problem using preflow and shortest paths.
- Introduced a preflow method based on Karzanov's concept in the original network.
- Pushed local flow excess toward the sink using estimated shortest paths.
- Incorporated dynamic tree data structure for improved efficiency.
- Achieved a time complexity of O(n^3) on an n-vertex graph for dense graphs.
- Developed a parallel implementation running in O(n^2 log n) time using n processors and O(m) space.
- This method matches the performance of the Shiloach-Vishkin algorithm.
Cite This Study
Goldberg et al. (1988) studied this question.