Highly Influenced

# Regularizing graph centrality computations

@article{Sariyce2015RegularizingGC, 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.}, year={2015}, volume={76}, pages={106-119} }

- Published 2015 in J. Parallel Distrib. Comput.
DOI:10.1016/j.jpdc.2014.07.006

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

#### From This Paper

##### Figures, tables, and topics from this paper.

16 Citations

36 References

Similar Papers