Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- 1 March 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 50 (1-3) , 277-290
- https://doi.org/10.1007/bf01594940
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) timeMathematical Programming, 1990
- 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
- An efficient implementation of the network simplex methodPublished by Springer Nature ,1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- A network simplex methodMathematical Programming, 1976
- Computation of maximal flows in networksNaval Research Logistics Quarterly, 1955