Now showing items 1-1 of 1
Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs
Datenbank-Spektrum: Vol. 17, No. 2
Distance and centrality computations are important building blocks for modern graph databases as well as for dedicated graph analytics systems. Two commonly used centrality metrics are the compute-intense closeness and betweenness centralities, which require numerous expensive shortest distance calculations. We propose ...