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…