Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
Name
3563393.pdf
Size
451.83 KB
Format
Adobe PDF
Checksum (MD5)
777713f4599dbad4379679fff496b53e
Author(s)
Abboud, Amir
Grandoni, Fabrizio
Vassilevska Williams, Virginia
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3563393
