Computing Top-k Closeness Centrality in Fully-dynamic Graphs. - Patrick Bisenius; Elisabetta Bergamini; Eugenio Angriman; Henning Meyerhenke (CoRR, 2017)

Computing Top-k Closeness Centrality in Fully-dynamic Graphs. - Patrick Bisenius; Elisabetta Bergamini; Eugenio Angriman; Henning Meyerhenke (ALENEX, 2018)

Computing Top-k Closeness Centrality in Fully Dynamic Graphs. - Eugenio Angriman; Patrick Bisenius; Elisabetta Bergamini; Henning Meyerhenke (Massive Graph Analytics, 2022)