E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs
TKDD, 13(5), 2019
DOI, RIS, BibTex

E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs
CoRR, 170401077, 2017
arXiv eprint, RIS, BibTex

E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016
DOI, RIS, BibTex