Maximum flow by augmenting paths in n^2+o(1) time

DOI10.1109/FOCS61266.2024.00123MaRDI QIDQ7286998zbMATH OpenFDO

Authors Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1109/FOCS61266.2024.00123

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(1)

• Near-optimal algorithm for directed expander decompositions

This page was built for publication: Maximum flow by augmenting paths in \(n^{2+o(1)}\) time

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