More efficient parallel flow algorithms

DOI10.1007/BFB0015428MaRDI QIDQ6487968zbMATH OpenFDO

Authors Jordan Gergov, Torben Hagerup

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015428

Mathematics Subject Classification ID

Flows in graphs (05C21) Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 43583
• scientific article; zbMATH DE number 3894470
• Efficient parallel algorithms for the minimum cost flow problem
• Efficient parallel algorithms for parameterized problems
• scientific article; zbMATH DE number 545138
• scientific article; zbMATH DE number 30939
• Parallel Algorithms for Reducible Flow Graphs
• Efficient parallelization of a parabolized flow solver
• Refinement of parallel algorithms
• Efficient low-contention parallel algorithms

Cites work

• A Fast and Simple Algorithm for the Maximum Flow Problem
• A new approach to the maximum-flow problem
• A parallel blocking flow algorithm for acyclic networks
• An O(n2log n) parallel max-flow algorithm
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Deterministic coin tossing with applications to optimal parallel list ranking
• Efficient parallel algorithms for graph problems
• Fast Deterministic Processor Allocation
• Finding Minimum-Cost Circulations by Successive Approximation
• scientific article; zbMATH DE number 3843145 (Why is no real title available?)
• scientific article; zbMATH DE number 742994 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Improved Algorithms for Bipartite Network Flow
• Improved deterministic parallel integer sorting
• Improved Time Bounds for the Maximum Flow Problem
• Maintaining discrete probability distributions optimally
• Optimal bounds for decision problems on the CRCW PRAM
• Processor-efficient implementation of a maximum flow algorithm

Cited in

(11)

• Parallel cardinality stacks and an application
• A parallel algorithm for finding a blocking flow in an acyclic network
• Sequential and parallel algorithms for minimum flows.
• Efficient preflow push algorithms
• A parallel realization of the Edmonds-Karp algorithm
• A parallel blocking flow algorithm for acyclic networks
• scientific article; zbMATH DE number 1538873 (Why is no real title available?)
• scientific article; zbMATH DE number 221929 (Why is no real title available?)
• Faster Update Time for Turnstile Streaming Algorithms
• Parallel algorithms for the maximum flow problem with minimum lot sizes
• Paralleling of Edmonds-Karp network flow algorithm

This page was built for publication: More efficient parallel flow algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487968)