Searching for "Gomory-Hu Trees." – sorted by Relevance.
35 documents found, showing 1 through 10.
Next 10 →
-
EFFICIENT AND ROBUST PREDICTION ALGORITHMS FOR PROTEIN COMPLEXES USING GOMORY-HU TREES
- … AND ROBUST PREDICTION ALGORITHMS FOR PROTEIN COMPLEXES USING GOMORY-HU TREES A. MITROFANOVA*, M. FARACH…
- Add To MetaCart
-
Cut Tree Algorithms
- … cut tree algorithms. In our tests, the GomoryHu algorithm with a right combination of heuristics…
- Add To MetaCart
-
Partitioning of Web Graphs by Community Topology
- … by a Gomory-Hu tree [10]. A Gomory-Hu tree of a connected graph G(V,E) is a tree with a set of vertices…
- Cited by 12 (0 self) – Add To MetaCart
-
Approximating Steiner k-Cuts
- … approximation algorithms for the problem: a 2 \Gamma 2 k -approximation based on Gomory-Hu trees, and a 2…
- Cited by 3 (0 self) – Add To MetaCart
-
0/1 Optimization and 0/1 Primal Separation are Equivalent
- … is based on the construction of a Gomory-Hu tree. 1 Introduction The polynomial time equivalence…
- Cited by 2 (0 self) – Add To MetaCart
-
Multilateral Transport Games
- … to well-known results in optimization including Mader's T -path Theorem, confluent flows, Gomory-Hu trees…
- Cited by 1 (1 self) – Add To MetaCart
-
Length Functions for Flow Computations
- … for those algorithms dominated by maximum flow computations. For example, a Gomory-Hu tree [27] can…
- Cited by 8 (0 self) – Add To MetaCart
-
Cut Tree Algorithms
- … for the cut tree problem. We study the Gomory-Hu and Gusfield's algorithms as well as heuristics aimed to make…
- Cited by 1 (0 self) – Add To MetaCart
-
Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related
- … minimum s-t cut in the graph. However, in many applications, the construction of the entire Gomory-Hu tree…
- Cited by 2 (0 self) – Add To MetaCart
-
• Focused crawling
- …-t minimum cut in D. There also exists a set D which is represented by a tree T called Gomory-Hu tree. Graph…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
