Computing Top-k Closeness Centrality in Fully-dynamic Graphs

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

Elisabetta Bergamin, Patrick Bisenius, Eugenio Angriman, Henning Meyerhenke

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

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs ⋮ CoVerD: community-based vertex defense against crawling adversaries ⋮ Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

This page was built for publication: Computing Top-k Closeness Centrality in Fully-dynamic Graphs