Sequential and parallel algorithms for minimum flows.
From MaRDI portal
Publication:1880468
DOI10.1007/BF02935746zbMath1139.90335MaRDI QIDQ1880468
Publication date: 28 September 2004
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Minimum flow problem on network flows with time-varying bounds, Inverse minimum flow problem, A new approach for computing a most positive cut using the minimum flow algorithms, The inverse maximum flow problem consideringl∞norm
Cites Work
- Unnamed Item
- Unnamed Item
- Processor-efficient implementation of a maximum flow algorithm
- A parallel algorithm for finding a blocking flow in an acyclic network
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Some Recent Advances in Network Flows
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- An O(n2log n) parallel max-flow algorithm