2011/10/28 by Agnieszka Łupińska, Łupińska, Agnieszka
Computer Science · #Complexity and Algorithms in Graphs #Distributed #FOS: Computer and information sciences #Graph Theory and Algorithms #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC) #cs.DC
paper · pdf · doi:10.48550/arxiv.1110.6231
MSc thesis, promoter: dr Maciej Ślusarek
arxiv created 2011/10/28 · openalex publication_date 2011/10/28 · arxiv updated 2011/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.