Scaling algorithms for network problems
- 31 October 1985
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 31 (2) , 148-168
- https://doi.org/10.1016/0022-0000(85)90039-x
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Fibonacci Heaps And Their Uses In Improved Network Optimization AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A scaling algorithm for weighted matching on general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Scaling and related techniques for geometry problemsPublished by Association for Computing Machinery (ACM) ,1984
- An efficient reduction technique for degree-constrained subgraph and bidirected network flow problemsPublished by Association for Computing Machinery (ACM) ,1983
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- 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
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On a routing problemQuarterly of Applied Mathematics, 1958