A simple reduction computes Gomory-Hu trees using polylog max-flow computations with near-linear total instance size for unweighted graphs.
All-pairs max-flow is no harder than single-pair max-flow: Gomory-hu trees in almost-linear time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows
A simple reduction computes Gomory-Hu trees using polylog max-flow computations with near-linear total instance size for unweighted graphs.