| dc.contributor.author | Abboud, Amir | |
| dc.contributor.author | Grandoni, Fabrizio | |
| dc.contributor.author | Vassilevska Williams, Virginia | |
| dc.date.accessioned | 2022-11-15T15:38:28Z | |
| dc.date.available | 2022-11-15T15:38:28Z | |
| dc.identifier.issn | 1549-6325 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/146446 | |
| dc.publisher | ACM | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1145/3563393 | en_US |
| dc.rights | 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. | en_US |
| dc.source | ACM | en_US |
| dc.title | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Abboud, Amir, Grandoni, Fabrizio and Vassilevska Williams, Virginia. "Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter." ACM Transactions on Algorithms. | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.relation.journal | ACM Transactions on Algorithms | en_US |
| dc.identifier.mitlicense | PUBLISHER_POLICY | |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2022-11-03T12:19:07Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | The author(s) | |
| dspace.date.submission | 2022-11-03T12:19:08Z | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
