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 [http://en.wikipedia.org/wiki/Gomory–Hu_tree].
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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 [http://en.wikipedia.org/wiki/Gomory–Hu_tree].