Reduction from Betweenness Centrality (BC) to Directed, Weighted APSP
Jump to navigation
Jump to search
FROM: Betweenness Centrality (BC) TO: Directed, Weighted APSP
Description
Implications
Year
2015
Reference
Amir Abboud, Fabrizio Grandoni, and Virginia Vassilevska Williams. Subcubic equivalences between graph centrality problems, APSP and diameter. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1681–1697, 2015.