Gomory-Hu Tree in Subcubic Time

11/09/2021
by   Amir Abboud, et al.
0

In 1961, Gomory and Hu showed that the max-flow values of all n 2 pairs of vertices in an undirected graph can be computed using only n-1 calls to any max-flow algorithm, and succinctly represented them in a tree (called the Gomory-Hu tree later). Even assuming a linear-time max-flow algorithm, this yields a running time of O(mn) for this problem; with current max-flow algorithms, the running time is Õ(mn + n^5/2). We break this 60-year old barrier by giving an Õ(n^2)-time algorithm for the Gomory-Hu tree problem, already with current max-flow algorithms. For unweighted graphs, our techniques show equivalence (up to poly-logarithmic factors in running time) between Gomory-Hu tree (i.e., all-pairs max-flow values) and a single-pair max-flow.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2021

Faster Cut-Equivalent Trees in Simple Graphs

Let G = (V, E) be an undirected connected simple graph on n vertices. A ...
research
10/10/2019

A Fast Max Flow Algorithm

In 2013, Orlin proved that the max flow problem could be solved in O(nm)...
research
11/03/2021

Augmenting Edge Connectivity via Isolating Cuts

We give an algorithm for augmenting the edge connectivity of an undirect...
research
03/01/2022

Fair Cuts, Approximate Isolating Cuts, and Approximate Gomory-Hu Trees in Near-Linear Time

In this paper, we introduce a robust notion of (1+ϵ)-approximate (s, t)-...
research
12/08/2012

A fair comparison of many max-tree computation algorithms (Extended version of the paper submitted to ISMM 2013

With the development of connected filters for the last decade, many algo...
research
06/05/2021

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time

We design an n^2+o(1)-time algorithm that constructs a cut-equivalent (G...
research
11/03/2021

Approximate Gomory-Hu Tree Is Faster Than n-1 Max-Flows

The Gomory-Hu tree or cut tree (Gomory and Hu, 1961) is a classic data s...

Please sign up or login with your details

Forgot password? Click here to reset