The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
"Accelerating GPU Betweenness Centrality" by McLaughlin and Bader ably addresses the challenges to authors of efficient graph implementations in the important context of a computation called betweenness centrality.
We present a hybrid GPU implementation that provides good performance on graphs of arbitrary structure rather than just scale-free graphs as was done previously.