Analysis of Preflow Push Algorithms for Maximum Network Flow
- 1 December 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (6), 1057-1086
- https://doi.org/10.1137/0218072
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronizationNetworks, 1985
- Complexity of network synchronizationJournal of the ACM, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- On the theoretical efficiency of various network flow algorithmsTheoretical Computer Science, 1981
- An O(V 5/3 E 2/3) algorithm for the maximal flow problemActa Informatica, 1980
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956