6118

Parallel implematation of flow and matching algorithms

Agnieszka Lupinska
Jagiellonian University, Krakow
arXiv:1110.6231v1 [cs.DC] (28 Oct 2011)
BibTeX

Download Download (PDF)   View View   Source Source   

1683

views

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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Contact us:

contact@hpgu.org