Scaling betweenness centrality using communication-efficient sparse matrix multiplication.

Edgar Solomonik Maciej Besta Flavio Vella Torsten Hoefler

Published in: SC (2017)

Keyphrases

matrix multiplication
high dimensional
complex networks
special case
social networks
text mining
shortest path
parallel algorithm
betweenness centrality