Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter

Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams. Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 1681-1697, SIAM, 2015. [doi]

Abstract

Abstract is missing.