On implementing push-relabel method for the maximum flow problem
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 157-171
- https://doi.org/10.1007/3-540-59408-6_49
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Can a maximum flow be computed in o(nm) time?Published by Springer Nature ,2005
- Goldberg’s algorithm for maximum flow in perspective: a computational studyPublished by American Mathematical Society (AMS) ,1993
- An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum FlowPublished by Springer Nature ,1992
- 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
- 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
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972