Publication
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
Reference
@inproceedings{DBLP:conf/alenex/BiseniusBAM18,
author = "P. Bisenius and E. Bergamini and E. Angriman and H. Meyerhenke",
title = "{C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs",
year = 2018,
booktitle = "Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018.",
doi = "10.1137/1.9781611975055.3"
}