Gomory–Hu tree
id:
gomory-hu-tree-187-12707804
title:
Gomory–Hu tree
text:
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 all s-t pairs in the graph. The Gomory–Hu tree can be constructed in |V| − 1 maximum flow computations. It is named for Ralph E. Gomory and T. C. Hu.
brand slug:
wiki
category slug:
encyclopedia
description:
Weighted tree representing s-t cuts of a graph
original url:
https://en.wikipedia.org/wiki/Gomory%E2%80%93Hu_tree
date created:
2009-08-24T08:04:51Z
date modified:
2024-09-08T15:10:30Z
main entity:
{"identifier":"Q5581241","url":"https://www.wikidata.org/entity/Q5581241"}
image:
fields total:
13
integrity:
15