A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke. "Computing top-k Closeness Centrality Faster in Unweighted Graphs." ACM Transactions on Knowledge Discovery from Data 13.5 (2019) 1-40