Reduction from Directed, Weighted APSP to 2-sensitive decremental st-shortest paths: 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 12:1912:19, 15 February 2023‎ Admin talk contribs‎ 554 bytes +554‎ Created page with "FROM: Directed, Weighted APSP TO: 2-sensitive decremental st-shortest paths == Description == == Implications == assume: APSP Hypothesis<br/>then: target cannot be solved with preprocessing time $O(n^{3-\epsilon})$ and update and query times $O(n^{2-\epsilon})$ for any $\epsilon > {0}$ in undirected weighted graphs == Year == 2017 == Reference == Henzinger, M., Lincoln, A., Neumann, S., & Williams, V. V. (2017). Conditional hardness for sensitivity p..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_Directed,_Weighted_APSP_to_2-sensitive_decremental_st-shortest_paths"