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]
@inproceedings{AbboudGW15,
title = {Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter},
author = {Amir Abboud and Fabrizio Grandoni and Virginia Vassilevska Williams},
year = {2015},
doi = {10.1137/1.9781611973730.112},
url = {http://dx.doi.org/10.1137/1.9781611973730.112},
researchr = {https://researchr.org/publication/AbboudGW15},
cites = {0},
citedby = {0},
pages = {1681-1697},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015},
editor = {Piotr Indyk},
publisher = {SIAM},
isbn = {978-1-61197-373-0},
}