Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs
Crossref DOI link: https://doi.org/10.1007/s13222-017-0261-x
Published Online: 2017-06-22
Published Print: 2017-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Then, Manuel http://orcid.org/0000-0002-9744-5879
Günnemann, Stephan
Kemper, Alfons
Neumann, Thomas
Funding for this research was provided by:
Deutsche Forschungsgemeinschaft (GU 1409/2-1)
Seventh Framework Programme (291763)
Oracle
License valid from 2017-06-22