Manuel Then, Stephan Günnemann, Alfons Kemper, Thomas Neumann 0001. Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs. Datenbank-Spektrum, 17(2):169-182, 2017. [doi]
@article{ThenGKN17,
title = {Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs},
author = {Manuel Then and Stephan Günnemann and Alfons Kemper and Thomas Neumann 0001},
year = {2017},
doi = {10.1007/s13222-017-0261-x},
url = {https://doi.org/10.1007/s13222-017-0261-x},
researchr = {https://researchr.org/publication/ThenGKN17},
cites = {0},
citedby = {0},
journal = {Datenbank-Spektrum},
volume = {17},
number = {2},
pages = {169-182},
}