%0 Conference Paper %1 conf/alenex/BiseniusBAM18 %A Bisenius, Patrick %A Bergamini, Elisabetta %A Angriman, Eugenio %A Meyerhenke, Henning %B ALENEX %D 2018 %E Pagh, Rasmus %E Venkatasubramanian, Suresh %I SIAM %K dblp %P 21-35 %T Computing Top-k Closeness Centrality in Fully-dynamic Graphs. %U http://dblp.uni-trier.de/db/conf/alenex/alenex2018.html#BiseniusBAM18 %@ 978-1-61197-505-5

@inproceedings{conf/alenex/BiseniusBAM18, added-at = {2019-09-16T00:00:00.000+0200}, author = {Bisenius, Patrick and Bergamini, Elisabetta and Angriman, Eugenio and Meyerhenke, Henning}, biburl = {https://www.bibsonomy.org/bibtex/2c796ca7b34ae6969cbf2941bd4dceae3/dblp}, booktitle = {ALENEX}, crossref = {conf/alenex/2018}, editor = {Pagh, Rasmus and Venkatasubramanian, Suresh}, ee = {https://doi.org/10.1137/1.9781611975055.3}, interhash = {022d1a6a4279443bc29ff52b3771b6e4}, intrahash = {c796ca7b34ae6969cbf2941bd4dceae3}, isbn = {978-1-61197-505-5}, keywords = {dblp}, pages = {21-35}, publisher = {SIAM}, timestamp = {2019-09-17T12:55:19.000+0200}, title = {Computing Top-k Closeness Centrality in Fully-dynamic Graphs.}, url = {http://dblp.uni-trier.de/db/conf/alenex/alenex2018.html#BiseniusBAM18}, year = 2018 }