English

Parallel implematation of flow and matching algorithms

Distributed, Parallel, and Cluster Computing 2011-10-31 v1

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.

Keywords

Cite

@article{arxiv.1110.6231,
  title  = {Parallel implematation of flow and matching algorithms},
  author = {Agnieszka Łupińska},
  journal= {arXiv preprint arXiv:1110.6231},
  year   = {2011}
}

Comments

MSc thesis, promoter: dr Maciej \'Slusarek

R2 v1 2026-06-21T19:27:17.996Z