Discrete Math.

Jan 01, This is an experimental study of algorithms for the cut tree problem. We study the Gomory–Hu and Gusfield algorithms as well as heuristics aimed to make the former algorithm faster.

We develop an efficient implementation of the Gomory–Hu algorithm.

It has uses in solving a variety of network flow problems and to jive data sets.

We also develop problem families for testing cut tree treecut.bar by: This is an experimental study of algorithms for the cut tree problem. We study the Gomory–Hu and Gusfield algorithms as well as heuristics aimed to make the former algorithm faster. We develop an efficient implementation of the Gomory–Hu algorithm. We also develop problem families for testing cut tree treecut.bar by: Nov 01, There are two well known algorithms for building a cut tree of an undirected graph: Gomory–Hu and Gusfield algorithms.

We refer to these algorithms as GH and Gus, respectively.

The GH and Gus algorithms present similarities and differences. A similarity is that both call a minimum s – t-cut algorithm n − 1 treecut.bar by: 2. Two sequential algorithms to compute a cut tree of a capacitated undirected graph are well known: the Gomory–Hu algorithm and the Gusfield algorithm.

In this work three parallel cut tree algorithms are presented, including parallel versions of Gusfield and Gomory–Hu algorithms.

So the remaining analysis deals with the number of times we need to splay.

A hybrid algorithm that combines techniques from both algorithms is proposed which provides a more robust performance for Cited by: 2. In our tests, the GomoryHu algorithm with a right combination of heuristics was significantly more robust than Gusfield's algorithm. 1 Introduction Cut trees, introduced by Gomory and Hu and also Estimated Reading Time: 9 mins.