Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Andrew V. GoldbergCut (graph theory)Cycle basisCycle space

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Gomory-Chvatal cuts are prominent in integer programming. The Gomory-Chvatal closure of a polyhedron is the intersection of all… 
2016
2016
Global Optimization for Multi-Channel Wireless Data Broadcast with AH-Tree Indexing Scheme
Multi-channel wireless data broadcast is an appropriate approach to disseminate data to a mass number of mobile clients. In this… 
2013
2013
Fluid surface reconstruction based on specular reflection model
This paper puts forward a hierarchical method of fluid surface modeling in natural landscapes. The proposed method produces a… 
2012
2012
Point track creation in unordered image collections using Gomory-Hu trees
Geometric reconstruction from image collections is a classical computer vision problem. The problem essentially consists of two… 
2011
2011
Tana Hu U’Falig
2011
2011
Characterization of a pig skeletal muscle microarray to study pork quality : the GenmascqChip 15 K
Pork quality is highly variable and availability of relevant predictors of fresh meat quality at slaughter is critical to… 
2010
2010
A Novel and Effective QoS Guarantee Scheme in WiMAX System
IEEE Std 802.16 is a promising wireless broadband technology for the next generation last mile access. Though Quality of service… 
2008
2008
Efficient Algorithms for Steiner Edge Connectivity Computation and Gomory-Hu Tree Construction for Unweighted Graphs ∗
We first consider the Steiner edge connectivity problem on an unweighted undirected or Eulerian directed graph with n vertices… 
Review
2006
Review
2006
Lagrangian Relax-and-Cut Algorithms
  • A. Lucena
  • Handbook of Optimization in Telecommunications
  • 2006
  • Corpus ID: 24967336
Attempts to allow exponentially many inequalities to be candidates to Lagrangian dualization date from the early 1980s. In the… 
2001
2001
Plant location and procurement planning in knockdown production systems
We consider an integrated problem of plant location and capacity planning for components procurement in knockdown production… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)