Minimum cuts in directed graphs via partial sparsification

DOI10.1109/FOCS52979.2021.00113MaRDI QIDQ6943437zbMATH OpenFDO

Authors Kent Quanrud, Jason Li, Thatchaphol Saranurak, Danupon Nanongkai, Debmalya Panigrahi

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00113

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(2)

• Maximum flow and minimum-cost flow in almost-linear time
• Faster algorithm for second (s,t)-mincut and breaking quadratic barrier for dual edge sensitivity for (s,t)-mincut

This page was built for publication: Minimum cuts in directed graphs via partial sparsification

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