Deterministic minimum cut in poly-logarithmic maximum flows

DOI10.1145/3744737MaRDI QIDQ6912092zbMATH OpenFDO

Authors Jason Li, Debmalya Panigrahi

Publication date 23 October 2025

Published in Journal of the ACM (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

minimum cut algorithmisolating cuts

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Flows in graphs (05C21) Connectivity (05C40)

This page was built for publication: Deterministic minimum cut in poly-logarithmic maximum flows

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