Faster cut-equivalent trees in simple graphs

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

Authors Tianyi Zhang

Publication date 24 June 2024

zbMATH Keywords

graph algorithmsminimum cutsmax-flow

Mathematics Subject Classification ID

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

Cited in

(1)

• Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows

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)