Parallel Algorithms

Faster Betweenness Centrality Based on Data Structure Experimentation
Betweenness centrality is a graph analytic that states the importance of a vertex based on the number of shortest paths that it is on. …
PDF Cite DOI
GPU Merge Path: A GPU Merging Algorithm
Graphics Processing Units (GPUs) have become ideal candidates for the development of fine-grain parallel algorithms as the number of …
PDF Cite DOI