Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs

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]

Abstract

Abstract is missing.