Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Kshitij Shukla, Sai Charan Regunta, Sai Harsh Tondomker, Kishore Kothapalli. Efficient parallel algorithms for betweenness- and closeness-centrality in dynamic graphs. In Eduard Ayguadé, Wen-mei W. Hwu, Rosa M. Badia, H. Peter Hofstee, editors, ICS '20: 2020 International Conference on Supercomputing, Barcelona Spain, June, 2020. ACM, 2020. [doi]

This author has not been identified. Look up 'Kshitij Shukla' in GoogleThis author has not been identified. Look up 'Sai Charan Regunta' in GoogleThis author has not been identified. Look up 'Sai Harsh Tondomker' in GoogleThis author has not been identified. Look up 'Kishore Kothapalli' in Google

runs on WebDSL