Fast Algorithms for Bipartite Network Flow
- 1 April 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (2) , 237-251
- https://doi.org/10.1137/0216020
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow TechniquesManagement Science, 1986
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Connectivity and edge-disjoint spanning treesInformation Processing Letters, 1983
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight VectorMathematics of Operations Research, 1980
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- k-Components, Clusters and Slicings in GraphsSIAM Journal on Applied Mathematics, 1972
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961