Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
ACM
2022
|
| Online Access: | https://hdl.handle.net/1721.1/146446 |
| _version_ | 1826215603299418112 |
|---|---|
| author | Abboud, Amir Grandoni, Fabrizio Vassilevska Williams, Virginia |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Abboud, Amir Grandoni, Fabrizio Vassilevska Williams, Virginia |
| author_sort | Abboud, Amir |
| collection | MIT |
| first_indexed | 2024-09-23T16:36:31Z |
| format | Article |
| id | mit-1721.1/146446 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T16:36:31Z |
| publishDate | 2022 |
| publisher | ACM |
| record_format | dspace |
| spelling | mit-1721.1/1464462023-07-05T19:18:15Z Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter Abboud, Amir Grandoni, Fabrizio Vassilevska Williams, Virginia Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2022-11-15T15:38:28Z 2022-11-15T15:38:28Z 2022-11-03T12:19:07Z Article http://purl.org/eprint/type/ConferencePaper 1549-6325 https://hdl.handle.net/1721.1/146446 Abboud, Amir, Grandoni, Fabrizio and Vassilevska Williams, Virginia. "Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter." ACM Transactions on Algorithms. PUBLISHER_POLICY en http://dx.doi.org/10.1145/3563393 ACM Transactions on Algorithms 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. The author(s) application/pdf ACM ACM |
| spellingShingle | Abboud, Amir Grandoni, Fabrizio Vassilevska Williams, Virginia Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter |
| title | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter |
| title_full | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter |
| title_fullStr | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter |
| title_full_unstemmed | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter |
| title_short | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter |
| title_sort | subcubic equivalences between graph centrality problems apsp and diameter |
| url | https://hdl.handle.net/1721.1/146446 |
| work_keys_str_mv | AT abboudamir subcubicequivalencesbetweengraphcentralityproblemsapspanddiameter AT grandonifabrizio subcubicequivalencesbetweengraphcentralityproblemsapspanddiameter AT vassilevskawilliamsvirginia subcubicequivalencesbetweengraphcentralityproblemsapspanddiameter |