Computing Top-k Closeness Centrality in Fully Dynamic Graphs

Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamini, Henning Meyerhenke. Computing Top-k Closeness Centrality in Fully Dynamic Graphs. In David A. Bader, editor, Massive Graph Analytics. pages 161-192, Chapman and Hall/CRC, 2022. [doi]

Abstract

Abstract is missing.