my-server
← Wiki Redirected from Gomory-Hu tree

Gomory–Hu tree

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 s-t pairs in the graph. The Gomory–Hu tree can be constructed in maximum flow computations. It is named for Ralph E. Gomory and T. C. Hu.

Definition

Let be an undirected graph with being the capacity of the edge respectively.

Denote the minimum capacity of an - cut by for each .
Let be a tree, and denote the set of edges in an - path by for each .

Then is said to be a Gomory–Hu tree of , if for each

where

  1. are the two connected components of , and thus forms an - cut in .
  2. is the capacity of the cut in .

Algorithm

Gomory–Hu Algorithm

Input: A weighted undirected graph
Output: A Gomory–Hu Tree
  1. Set
  2. Choose some with if such exists. Otherwise, go to step 6.
  3. For each connected component let
  4. :Let
  5. : Contract the components to form where:
  6. :: is the capacity function, defined as:
  7. Choose two vertices and find a minimum cut in .
  8. :Set
  9. Set
  10. :For each do:
  11. :#Set if otherwise set
  12. :#Set
  13. :#Set
  14. :Set
  15. :Set
  16. :Go to step 2.
  17. Replace each by and each by . Output .

Analysis

Using the submodular property of the capacity function , one has

Then it can be shown that the minimum cut in is also a minimum cut in for any .

To show that for all for some , throughout the algorithm, one makes use of the following lemma,

For any in ,

The lemma can be used again repeatedly to show that the output satisfies the properties of a Gomory–Hu Tree.

Example

The following is a simulation of the Gomory–Hu's algorithm, where

  1. green circles are vertices of T.
  2. red and blue circles are the vertices in G<nowiki>'</nowiki>.
  3. grey vertices are the chosen s and t.
  4. red and blue coloring represents the s-t cut.
  5. dashed edges are the s-t cut-set.
  6. A is the set of vertices circled in red and B is the set of vertices circled in blue.

Implementations: Sequential and Parallel

Gusfield's algorithm can be used to find a Gomory–Hu tree without any vertex contraction in the same running time-complexity, which simplifies the implementation of constructing a Gomory–Hu Tree.

Andrew V. Goldberg and K. Tsioutsiouliklis implemented the Gomory-Hu algorithm and Gusfield algorithm, and performed an experimental evaluation and comparison.

Cohen et al. report results on two parallel implementations of Gusfield's algorithm using OpenMP and MPI, respectively.

Related concepts

In planar graphs, the Gomory–Hu tree is dual to the minimum weight cycle basis, in the sense that the cuts of the Gomory–Hu tree are dual to a collection of cycles in the dual graph that form a minimum-weight cycle basis.

See also

References