Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Keyboard shortcuts
h, / search box
j, ↓ next result
k, ↑ prev result
l, o, Enter go
More...
Ctrl+Enter bg
', v new tab
d domain search
t Top
!, 1 !bang dropdown
esc out of bangs
s Did you mean
r related topics
m main results
More explanation...
Gomory-Hu tree
In combinatorial optimization, the Gomory–Hu tree of an undirected graph with capacities is a weighted tree that consists of edges representing all pairs minimum s-t cut in the graph.
More at Wikipedia
Cut (graph theory)
Max-flow min-cut theorem
More related topics
Maximum flow problem
Network flow
Combinatorial optimization
Graph algorithms
This page requires Javascript.Get the non-JS version
here
.