More efficient parallel flow algorithms
From MaRDI portal
Publication:6487968
DOI10.1007/BFB0015428zbMath1512.68439MaRDI QIDQ6487968
Jordan Gergov, Unnamed Author, Torben Hagerup
Publication date: 21 March 2023
Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved deterministic parallel integer sorting
- Processor-efficient implementation of a maximum flow algorithm
- Efficient parallel algorithms for graph problems
- A Fast and Simple Algorithm for the Maximum Flow Problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Finding Minimum-Cost Circulations by Successive Approximation
- Deterministic coin tossing with applications to optimal parallel list ranking
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- An O(n2log n) parallel max-flow algorithm
- A parallel blocking flow algorithm for acyclic networks
- Improved Algorithms for Bipartite Network Flow
- Maintaining discrete probability distributions optimally
- Optimal bounds for decision problems on the CRCW PRAM
- Fast Deterministic Processor Allocation
This page was built for publication: More efficient parallel flow algorithms
