Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality

From Algorithm Wiki
Jump to navigation Jump to search

FROM: Directed, Weighted APSP TO: Directed All-Nodes Reach Centrality

Description

Implications

if: to-time: Truly subcubic
then: from-time: Truly subcubic

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.

https://epubs.siam.org/doi/10.1137/1.9781611973730.112, Corollary 4.1

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Reduction_from_Directed,_Weighted_APSP_to_Directed_All-Nodes_Reach_Centrality&oldid=45153"