P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
CoRR, 171001143, 2017
arXiv eprint, RIS, BibTex

P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018
DOI, RIS, BibTex