A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs

06/04/2021

∙

by   Jason Li, et al.

∙

0

∙

share

We give an n^2+o(1)-time algorithm for finding s-t min-cuts for all pairs of vertices s and t in a simple, undirected graph on n vertices. We do so by constructing a Gomory-Hu tree (or cut equivalent tree) in the same running time, thereby improving on the recent bound of Õ(n^2.5) by Abboud et al. (FOCS 2021). Our running time is nearly optimal as a function of n.