Efficient data structures for incremental exact and approximate maximum flow

DOI10.4230/LIPICS.ICALP.2023.69MaRDI QIDQ6638072zbMATH OpenFDO

Authors Gramoz Goranci, Monika R. Henzinger

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.69

zbMATH Keywords

data structuresdynamic graph algorithmsmaximum flow

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(3)

• Faster algorithm for second (s,t)-mincut and breaking quadratic barrier for dual edge sensitivity for (s,t)-mincut
• Incremental approximate maximum flow via residual graph sparsification
• Incremental approximate maximum flow via residual graph sparsification

This page was built for publication: Efficient data structures for incremental exact and approximate maximum flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638072)