Reduction from Reach Centrality to Diameter: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:5510:55, 15 February 2023‎ Admin talk contribs‎ 486 bytes +486‎ Created page with "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/doi/10.1137/1.9781611..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_Reach_Centrality_to_Diameter"