Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Manuel Then' in GoogleThis author has not been identified. Look up 'Stephan Günnemann' in GoogleThis author has not been identified. Look up 'Alfons Kemper' in GoogleThis author has not been identified. Look up 'Thomas Neumann 0001' in Google

runs on WebDSL