Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter

Author(s)
Abboud, Amir; Grandoni, Fabrizio; Vassilevska Williams, Virginia
Thumbnail
Download3563393.pdf (451.8Kb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
URI
https://hdl.handle.net/1721.1/146446
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
ACM Transactions on Algorithms
Publisher
ACM
Citation
Abboud, Amir, Grandoni, Fabrizio and Vassilevska Williams, Virginia. "Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter." ACM Transactions on Algorithms.
Version: Final published version
ISSN
1549-6325
Collections