Computing top-k Closeness Centrality Faster in Unweighted Graphs

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
2019 ACM Transactions on Knowledge Discovery from Data  
doi:10.1145/3344719 fatcat:hfuu46acanb2bl7gqtxoklkuhi