Fully dynamic approximate minimum cut in subpolynomial time per operation

DOI10.1137/1.9781611978322.22MaRDI QIDQ7289580zbMATH OpenFDO

Authors Monika R. Henzinger, Jason Li

Publication date 3 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978322.22

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Length-constrained directed expander decomposition and length-constrained vertex-capacitated flow shortcuts

This page was built for publication: Fully dynamic approximate minimum cut in subpolynomial time per operation

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