Regularizing graph centrality computations

  title={Regularizing graph centrality computations},
  author={Ahmet Erdem Sariy{\"u}ce and Erik Saule and Kamer Kaya and {\"U}mit V. Çataly{\"u}rek},
  journal={J. Parallel Distrib. Comput.},
Centralitymetrics such as betweenness and closeness have been used to identify important nodes in a network. However, it takes days to months on a high-end workstation to compute the centrality of today’s networks. Themain reasons are the size and the irregular structure of these networks.While today’s computing units excel at processing dense and regular data, their performance is questionable when the data is sparse. In this work, we show how centrality computations can be regularized to… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
16 Citations
36 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 36 references


  • D. A. Bader, K. Madduri
  • Small-world Network Analysis and Partitioning: An…
  • 2008
Highly Influential
6 Excerpts

Edge vs

  • Y. Jia, V. Lu, J. Hoberock, M. Garland, J. C. Hart
  • node parallelism for graph centrality metrics, in…
  • 2011
Highly Influential
4 Excerpts

Blelloch . Ligra : A lightweight graph processing framework for shared memory

  • J. Demmel
  • Proceedings of the 18 th ACM SIGPLAN Symposium on…
  • 2013

Similar Papers

Loading similar papers…