17 citations · 47 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DC2016
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Edgar Solomonik, Maciej Besta, Flavio Vella +1
Betweenness centrality (BC) is a crucial graph problem that measures the significance of a vertex by the number of shortest paths leading through it. We propose Maximal Frontier Be…
cs.DC2016★ 6 cited
Algorithms and Heuristics for Scalable Betweenness Centrality Computation on Multi-GPU Systems
Flavio Vella, Giancarlo Carbone, Massimo Bernaschi
Betweenness Centrality (BC) is steadily growing in popularity as a metrics of the influence of a vertex in a graph. The BC score of a vertex is proportional to the number of all-pa…