ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
Article URLs:
Alternative Article URLs:
Authors: Amir Abboud
  • Stanford University
Fabrizio Grandoni
  • University of Lugano, IDSIA
Virginia Vassilevska Williams
  • Stanford University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1417238
DBLP Key: conf/soda/AbboudGW15
Author Comments:

Discuss this paper and its artifacts below