Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path: 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.

    15 February 2023

    • curprev 11:5511:55, 15 February 2023‎ Admin talk contribs‎ 661 bytes +661‎ Created page with "FROM: Directed, Weighted APSP TO: Dynamic $st$-Shortest Path == Description == == Implications == if: to-time: amortized $O(n^{2-\epsilon})$ update and query times in decremental or incremental graphs<br/>then: APSP Hypothesis is false == Year == 2014 == Reference == Abboud, Amir, and Virginia Vassilevska Williams. "Popular conjectures imply strong lower bounds for dynamic problems." In 2014 IEEE 55th Annual Symposium on Foundations of Computer Scien..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_Directed,_Weighted_APSP_to_Dynamic_$st$-Shortest_Path"