A Parallel Algorithm for Computing Betweenness Centrality

@article{Tan2009APA,
  title={A Parallel Algorithm for Computing Betweenness Centrality},
  author={Guangming Tan and Dengbiao Tu and Ninghui Sun},
  journal={2009 International Conference on Parallel Processing},
  year={2009},
  pages={340-347}
}
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on a novel algorithmic handling of access conflicts for a CREW PRAM algorithm. We propose a proper data-processor mapping, a novel edge-numbering strategy and a new triple array data structure recording the shortest path for eliminating conflicts to access the shared memory. The algorithm requires $O(n+m)$ space and $O… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS
25 Citations
12 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…