On the parallel implementation of Goldberg's maximum flow algorithm
- 1 June 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 168-177
- https://doi.org/10.1145/140901.140919
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A parallel shortest augmenting path algorithm for the assignment problemJournal of the ACM, 1991
- Analysis of Preflow Push Algorithms for Maximum Network FlowSIAM 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
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983