# Gomory–Hu tree

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- NOMS - IEEE/IFIP Network Operations and…
- 2016

We address the online virtual network embedding problem within the Cloud's backbone to optimally map the virtual routers and… (More)

Is this relevant?

2014

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

- ArXiv
- 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)

Is this relevant?

2012

2012

- IEEE 24th International Symposium on Computer…
- 2012

Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph, and have a… (More)

Is this relevant?

2012

2012

- Proceedings of the 21st International Conference…
- 2012

Geometric reconstruction from image collections is a classical computer vision problem. The problem essentially consists of two… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Proceedings of the National Academy of Sciences…
- 2012

Breast cancers are comprised of molecularly distinct subtypes that may respond differently to pathway-targeted therapies now… (More)

Is this relevant?

2011

2011

- JSW
- 2011

We propose a novel web page segmentation algorithm based on finding the Gomory-Hu tree in a planar graph. The algorithm firstly… (More)

Is this relevant?

2009

2009

- Pacific Symposium on Biocomputing
- 2009

Two-Hybrid (Y2H) Protein-Protein interaction (PPI) data suffer from high False Positive and False Negative rates, thus making… (More)

Is this relevant?

2008

2008

- 2008

We first consider the Steiner edge connectivity problem on an unweighted undirected or Eulerian directed graph with n vertices… (More)

Is this relevant?

2007

2007

- STOC
- 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?