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…

Papers overview

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

2016

Gomory-Chvatal cuts are prominent in integer programming. The Gomory-Chvatal closure of a polyhedron is the intersection of all…

2016

Multi-channel wireless data broadcast is an appropriate approach to disseminate data to a mass number of mobile clients. In this…

2015

A beam combination setup for a dual-frequency laser with orthogonal linear polarization is proposed. It consists of two…

2013

Introduction \ 1. With Herman Parret (1972) \ 2. With Noboru Yamaguchi & Shunichi Segawa (1977) \ 3. From The English Magazine…

2012

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

2011

2010

IEEE Std 802.16 is a promising wireless broadband technology for the next generation last mile access. Though Quality of service…

2009

2008

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

1994

We report on the construction of many binary linear codes improving the tables of the best known codes. We obtained our results…