k Closeness Centrality in Fully-dynamic Graphs

Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke. k Closeness Centrality in Fully-dynamic Graphs. In Rasmus Pagh, Suresh Venkatasubramanian, editors, Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018. pages 21-35, SIAM, 2018. [doi]

Abstract

Abstract is missing.