Improved Algorithms for Bipartite Network Flow
- 1 October 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 23 (5) , 906-933
- https://doi.org/10.1137/s0097539791199334
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Analysis of Preflow Push Algorithms for Maximum Network FlowSIAM Journal on Computing, 1989
- A Fast and Simple Algorithm for the Maximum Flow ProblemOperations Research, 1989
- Improved Time Bounds for the Maximum Flow ProblemSIAM Journal on Computing, 1989
- Parallel Merge SortSIAM Journal on Computing, 1988
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956