Approximate Gomory–Hu tree is faster than n – 1 max-flows

DOI10.1145/3406325.3451112arXiv2111.02022OpenAlexW3170659189MaRDI QIDQ6065289

Jason Li, Debmalya Panigrahi

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.02022

zbMATH Keywords

graph algorithmgraph connectivityGomory-Hu tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Approximate Gomory–Hu tree is faster than n – 1 max-flows