Gomory–Hu tree

Known as: Gomory-Hu algorithm, Gomory-Hu tree, Gomory–Hu algorithm 
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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We address the online virtual network embedding problem within the Cloud's backbone to optimally map the virtual routers and… (More)
  • figure 1
  • figure 2
  • table I
Is this relevant?
2014
2014
The world wide (www) serves a huge, widely distributed global information services. A huge amount of data have been accumulated… (More)
Is this relevant?
2013
2013
A cut tree (or Gomory-Hu tree) of an undirected weighted graph G = (V,E) encodes a minimum s-t-cut for each vertex pair {s, t… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph, and have a… (More)
  • figure 1
  • figure 2
  • table I
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Geometric reconstruction from image collections is a classical computer vision problem. The problem essentially consists of two… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Breast cancers are comprised of molecularly distinct subtypes that may respond differently to pathway-targeted therapies now… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
We propose a novel web page segmentation algorithm based on finding the Gomory-Hu tree in a planar graph. The algorithm firstly… (More)
  • figure 1
  • table I
  • figure 3
  • figure 5
Is this relevant?
2009
2009
Two-Hybrid (Y2H) Protein-Protein interaction (PPI) data suffer from high False Positive and False Negative rates, thus making… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2008
2008
We first consider the Steiner edge connectivity problem on an unweighted undirected or Eulerian directed graph with n vertices… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2007
2007
We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected… (More)
Is this relevant?