skip to main content


This content will become publicly available on January 1, 2025

Title: Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time
Award ID(s):
1844855
NSF-PAR ID:
10488620
Author(s) / Creator(s):
; ; ; ; ; ; ;
Publisher / Repository:
SIAM
Date Published:
Journal Name:
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found