Decremental $(1+\epsilon) $-Approximate Maximum Eigenvector: Dynamic Power Method

Almost-linear time algorithms for decremental graphs: Min-cost flow and more via duality

J Van Den Brand, L Chen, R Kyng… - 2024 IEEE 65th …, 2024 - ieeexplore.ieee.org
We give the first almost-linear total time algorithm for deciding if a flow of cost at most F still
exists in a directed graph, with edge costs and capacities, undergoing decremental updates …
Save Cite Cited by 2 Related articles All 7 versionsFree GPT-4
[Free GPT-4]
[PDF] arxiv.org

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality

J Brand, L Chen, R Kyng, YP Liu, S Meierhans… - arxiv preprint arxiv …, 2024 - arxiv.org
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $ F $
still exists in a directed graph, with edge costs and capacities, undergoing decremental …
Save Cite Related articles View as HTML