Reduction from CNF-SAT to dynamic st-Maximum Flow: 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‎ 551 bytes +551‎ Created page with "FROM: CNF-SAT TO: dynamic st-Maximum Flow == Description == == Implications == assume: SETH<br/>then: there is no algorithm for solving incremental (or decremental) st-max-flow on a weighted and directed graph with $n$ nodes and $\tilde{O}(n)$ edges with amortized time $O(m^{1-\epsilon})$ per operation for any $\epsilon > {0}$ == Year == 2016 == Reference == Dahlgaard, S. (2016). On the hardness of partially dynamic graph problems and connections to..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_CNF-SAT_to_dynamic_st-Maximum_Flow"