@inproceedings{bergamini:hal-01390137, TITLE = {{Computing Top-k Closeness Centrality Faster in Unweighted Graphs}}, AUTHOR = {Bergamini, Elisabetta and Borassi, Michele and Crescenzi, Pierluigi and Marino, Andrea and Meyerhenke, Henning}, URL = {https://inria.hal.science/hal-01390137}, BOOKTITLE = {{Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016}}, ADDRESS = {Arlington, United States}, YEAR = {2016}, DOI = {10.1137/1.9781611974317.6}, PDF = {https://inria.hal.science/hal-01390137/file/closeness-JV.pdf}, HAL_ID = {hal-01390137}, HAL_VERSION = {v1}, }