Computing Top-k Closeness Centrality in Fully-dynamic Graphs

DOI10.1137/1.9781611975055.3zbMath1429.68176arXiv1710.01143MaRDI QIDQ5232720

Henning Meyerhenke, Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamin

Publication date: 12 September 2019

Published in: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.01143

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)