Faster cut-equivalent trees in simple graphs

DOI10.4230/LIPICS.ICALP.2022.109MaRDI QIDQ6560908zbMATH OpenFDO

Authors Tianyi Zhang

Publication date 24 June 2024

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

zbMATH Keywords

graph algorithmsmax-flowminimum cuts

Mathematics Subject Classification ID

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

Cited in

(3)

• Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows
• Deterministic minimum cut in poly-logarithmic maximum flows
• High-speed minimum cut approximation in dense graph using compacted pruned tree

This page was built for publication: Faster cut-equivalent trees in simple graphs

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