Faster Scaling Algorithms for Network Problems
- 1 October 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (5) , 1013-1036
- https://doi.org/10.1137/0218069
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- On a routing problemQuarterly of Applied Mathematics, 1958