A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

We present a new lock-free parallel algorithm for computing betweenness centrality of massive complex networks that achieves better spatial locality compared with previous approaches. Betweenness centrality is a key kernel in analyzing the importance of vertices (or edges) in applications ranging fr... View More