Subcubic algorithms for Gomory-Hu tree in unweighted graphs.

Amir Abboud Robert Krauthgamer Ohad Trabelsi

Published in: STOC (2021)

Keyphrases

graph theory
computational complexity
minimum spanning tree
learning algorithm
lower bound
computational cost
optimization problems
graph theoretic
maximal cliques
significant improvement
graphical models
computationally efficient
tabu search
cutting plane