An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Analysis of Preflow Push Algorithms for Maximum Network FlowSIAM Journal on Computing, 1989
- Implementing Goldberg's max-flow-algorithm ? A computational investigationMathematical Methods of Operations Research, 1989
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- A computational comparison of the dinic and network simplex methods for maximum flowAnnals of Operations Research, 1988
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956