Serial and parallel implementations of computing the betweenness centrality for large sparse graphs using C++ and CUDA
-
Updated
Nov 25, 2018 - Cuda
Serial and parallel implementations of computing the betweenness centrality for large sparse graphs using C++ and CUDA
Maximum independent set problem - greedy and brute force parallel algorithms
Add a description, image, and links to the parallel-graph-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the parallel-graph-algorithms topic, visit your repo's landing page and select "manage topics."