A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Brief announcement: A special case of maximum flow over time with network changes
A condensed time-expanded network with O(n²μ) nodes and O(μmn) edges solves max flow over time with μ capacity changes in O(μ²n³m) time.