@InProceedings{bergamini_et_al:LIPIcs.SEA.2017.23,
author = {Bergamini, Elisabetta and Meyerhenke, Henning and Ortmann, Mark and Slobbe, Arie},
title = {{Faster Betweenness Centrality Updates in Evolving Networks}},
booktitle = {16th International Symposium on Experimental Algorithms (SEA 2017)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-036-1},
ISSN = {1868-8969},
year = {2017},
volume = {75},
editor = {Iliopoulos, Costas S. and Pissis, Solon P. and Puglisi, Simon J. and Raman, Rajeev},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2017.23},
URN = {urn:nbn:de:0030-drops-76093},
doi = {10.4230/LIPIcs.SEA.2017.23},
annote = {Keywords: Graph algorithms, shortest paths, distances, dynamic algorithms}
}