Parallel implematation of flow and matching algorithms
Agnieszka {\L}upi\'nska
TL;DR
This paper introduces two parallel, lock-free GPU algorithms for flow and matching problems, specifically the push-relabel method for grid graphs and the cost scaling algorithm for bipartite graphs, enhancing computational efficiency.
Contribution
The work presents novel parallel, lock-free GPU implementations of flow and matching algorithms, expanding the computational toolkit for large-scale graph problems.
Findings
Achieved efficient GPU-based parallel algorithms for flow and matching problems.
Demonstrated improved performance over traditional implementations.
Provided practical implementations using Nvidia CUDA.
Abstract
In our work we present two parallel algorithms and their lock-free implementations using a popular GPU environment Nvidia CUDA. The first algorithm is the push-relabel method for the flow problem in grid graphs. The second is the cost scaling algorithm for the assignment problem in complete bipartite graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Graph Theory and Algorithms · Optimization and Search Problems