This is the authors' abstract. We don't add key points for this paper.
Every undirected graph G has a (weighted) cut-equivalent tree T, commonly named after Gomory and Hu who discovered it in 1961. Both T and G have the same node set, and for every node pair s,t, the minimum (s,t)-cut in T is also an exact minimum (s,t)-cut in G.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Abboud et al. (2021) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: