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]
@inproceedings{BiseniusBAM18,
title = {k Closeness Centrality in Fully-dynamic Graphs},
author = {Patrick Bisenius and Elisabetta Bergamini and Eugenio Angriman and Henning Meyerhenke},
year = {2018},
doi = {10.1137/1.9781611975055.3},
url = {https://doi.org/10.1137/1.9781611975055.3},
researchr = {https://researchr.org/publication/BiseniusBAM18},
cites = {0},
citedby = {0},
pages = {21-35},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018},
editor = {Rasmus Pagh and Suresh Venkatasubramanian},
publisher = {SIAM},
isbn = {978-1-61197-505-5},
}