Parallel implematation of flow and matching algorithms

Details Parallel implematation of flow and matching algorithms Parallel implematation of flow and matching algorithms

2011-10-28

arxiv.org/abs/1110.6231v1

Computer Science

Distributed, Parallel, and Cluster Computing

MSc thesis, promoter: dr Maciej \'Slusarek

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parallel implematation of flow and matching algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallel implematation of flow and matching algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel implematation of flow and matching algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-685456