Scaling betweenness centrality using communication-efficient sparse matrix multiplication

Article Details
Title:	Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Article URLs:	https://doi.org/10.1145/3126908.3126971
Alternative Article URLs:
Authors:	Edgar Solomonik	University of Illinois at Urbana-Champaign, Department of Computer Science
	Maciej Besta	ETH Zurich, Department of Computer Science
	Flavio Vella	Sapienza University of Rome
	Torsten Hoefler	ETH Zurich, Department of Computer Science
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	Artifacts for some papers are reviewed by an artifact evaluation, reproducibility, or similarly named committee. This is one such paper that passed review. awarded
Artifact URLs:	https://github.com/solomonik/graph_centrality
Artifact Correspondence Email Addresses:
NSF Award Numbers:	0725070, 1238993
DBLP Key:	conf/sc/SolomonikBVH17
Author Comments:

ACM/IEEE Intl. Conf. for High Perf. Computing, Networking, Storage and Analysis, SC 2017