Reduction from Reach Centrality to Diameter: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tag: Reverted
No edit summary
Tags: Manual revert Reverted
Line 3: Line 3:
== Description ==  
== Description ==  


For directed graphs only
 


== Implications ==  
== Implications ==  


if: to-time: $\tilde{O}(T(n,m,M))$ for $n$-node $m$-edge directed graph with integer weights in $(-M,M)$<br/>then: from-time: $\tilde{O}(T(n,m,M))$ for $n$-node $m$-edge directed graph with integer weights in $(-M,M)$
 


== Year ==  
== Year ==  
Line 17: Line 17:
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.
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
https://epubs-siam-org.ezproxy.canberra.edu.au/doi/10.1137/1.9781611973730.112,

Revision as of 11:18, 15 February 2023

FROM: Reach Centrality TO: Diameter

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.

https://epubs-siam-org.ezproxy.canberra.edu.au/doi/10.1137/1.9781611973730.112,

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Reduction_from_Reach_Centrality_to_Diameter&oldid=45766"