Media type: Text; E-Article Title: Computing top-k Closeness Centrality Faster in Unweighted Graphs Contributor: Bergamini, Elisabetta [Author]; Borassi, Michele [Author]; Crescenzi, Pierluigi [Author]; Marino, Andrea [Author]; Meyerhenke, Henning [Author] Published: Association for Computing Machinery, 2019-10-01 Published in: ACM transactions on knowledge discovery from data, 13 (5), Art. Nr.: 53 ; ISSN: 1556-4681 Language: English DOI: https://doi.org/10.1145/3344719 ISSN: 1556-4681 Keywords: DATA processing & computer science Origination: Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen. Access State: Open Access