z-logo
open-access-imgOpen Access
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
Author(s) -
Amir Abboud,
Fabrizio Grandoni,
Virginia Vassilevska Williams
Publication year - 2023
Publication title -
acm transactions on algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.093
H-Index - 57
eISSN - 1549-6333
pISSN - 1549-6325
DOI - 10.1145/3563393
Subject(s) - betweenness centrality , centrality , mathematics , combinatorics , shortest path problem , graph , node (physics) , discrete mathematics , radius , computer science , structural engineering , engineering , computer security

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here