In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that represents the minimum s-t cuts for all...

problems included the representation of all pairwise flows using the Gomory–Hu tree,[GH61] the formulation of the multi-commodity flow problem,[H63] and...

space can be described by a tree on the same vertex set as the graph, called the Gomory–Hu tree. Each edge of this tree is associated with a bond in...

provide an extension of this result to multi-commodity flow problems. The Gomory–Hu tree of an undirected flow network provides a concise representation of all...

Gomory–Hu tree. When cycle weights may be tied, the minimum-weight cycle basis may not be unique, but in this case it is still true that the Gomory–Hu...

The minimum weight cycle basis of a planar graph corresponds to the Gomory–Hu tree of the dual graph. A spanning subgraph of a given graph G has the same...

in this way. Block-cut tree, a similar tree structure for the 2-vertex-connected components Gomory–Hu tree, a different tree structure that characterizes...

possible vertex pair can be collected into a structure known as the Gomory–Hu tree of the graph. A generalization of the minimum cut problem with terminals...

spaces and cut spaces, this basis for a planar graph corresponds to a Gomory–Hu tree of the dual graph, a minimum weight basis for its cut space. In planar...

achieving the same guarantee uses the Gomory–Hu tree representation of minimum cuts. Constructing the Gomory–Hu tree requires n − 1 max flow computations...

technique to convert any network flow algorithm to one that builds a Gomory-Hu tree, using only five added lines of pseudo-code. Another contribution was...

journal}}: CS1 maint: multiple names: authors list (link) Konnert, M., Fady, B., Gömöry, D., A'Hara, S., Wolter, F., Ducci, F., Koskela, J., Bozzano, M., Maaten...