Chapter IV Network flows
- 1 January 1989
- book chapter
- Published by Elsevier
- Vol. 1, 211-369
- https://doi.org/10.1016/s0927-0507(89)01005-4
Abstract
No abstract availableThis publication has 96 references indexed in Scilit:
- The shortest augmenting path method for solving assignment problems — Motivation and computational experienceAnnals of Operations Research, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981
- Computational Comparison of Eight Methods for the Maximum Network Flow ProblemACM Transactions on Mathematical Software, 1980
- Pivot Strategies for Primal-Simplex Network CodesJournal of the ACM, 1978
- Improved shortest path algorithms for transport networksTransportation Research, 1978
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955