Reduction from Reach Centrality to Diameter: Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tag: Manual revert |
| (3 intermediate revisions by the same user not shown) | |
(No difference)
| |
Latest revision as of 09:46, 28 April 2023
FROM: Reach Centrality TO: Diameter
Description
For directed graphs only
Implications
if: to-time: $\tilde{O}(T(n,m,M))$ for $n$-node $m$-edge directed graph with integer weights in $(-M,M)$
then: from-time: $\tilde{O}(T(n,m,M))$ for $n$-node $m$-edge directed graph with integer weights in $(-M,M)$
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.ezproxy.canberra.edu.au/doi/10.1137/1.9781611973730.112, Lemma 3.2