Login / Signup
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
Jan van den Brand
Li Chen
Rasmus Kyng
Yang P. Liu
Richard Peng
Maximilian Probst Gutenberg
Sushant Sachdeva
Aaron Sidford
Published in:
SODA (2024)
Keyphrases
</>
maximum flow
directed graph
undirected graph
minimum cut
random walk
directed acyclic graph
graph structure
approximation algorithms
strongly connected
random graphs
complex networks
push relabel
disjoint paths
connected components
min cut
spanning tree
adjacency matrix
social networks
markov chain
pairwise