1 Hit in 2.9 sec

Cut-Equivalent Trees are Optimal for Min-Cut Queries [article]

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2020 arXiv   pre-print
Algorithms 1998) implies the first near-linear time construction of cut-equivalent trees.  ...  Using state-of-the-art algorithms for minimum st-cut (Lee and Sidford, FOCS 2014) arXiv:1312.6713, one can construct the tree in time Õ(mn^3/2), which is also the preprocessing time of the data structure  ...  Analysis We start by showing that whenever our algorithm reports a tree, there exists a Gomory-Hu execution that produces the same tree.  ... 
arXiv:2009.06090v1 fatcat:l4sxbyvoqvdb7aqn4vwjunuidy