Subcubic algorithms for Gomory–Hu tree in unweighted graphs

DOI10.1145/3406325.3451073arXiv2012.10281OpenAlexW3166848088MaRDI QIDQ6065288

Robert Krauthgamer, Ohad Trabelsi, Amir Abboud

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/2012.10281

zbMATH Keywords

minimum cutmaximum flowGomory-Hu trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Mincut sensitivity data structures for the insertion of an edge ⋮ Unnamed Item

This page was built for publication: Subcubic algorithms for Gomory–Hu tree in unweighted graphs