Gomory-Hu Tree

Given n-node network Find F(i, j) = C(i, j)

X j X i

For all nodes g X and all node h X F(g, h) C(i, j)

Gomory-Hu Tree
e 4 5 1 i

e, j, g

i, h

F(i, e) = 5 F(i, h) = 4 F(j, h) = 2

Gomory-Hu Tree
j 5 e,g 2 i, h

e,g

i 4 h

5 5

i 4

Gomory-Hu Tree
Given a network of n nodes, there exists (n-1) Min Cuts separating the n nodes

a 1 1 3 e c

1 5 1 d 6 2

Gomory-Hu Tree
a 1 1 3 e 2 c 1 d 6 f 1 5 7 b

a c 5 e 4 d 12

13

Gomory-Hu Tree
Algorithm for G-H cut tree
f 10 e 8 d 3 2 3 c 2 4 a 4 2 7 5 b

d,e,f

13

a,b,c

Gomory-Hu Tree
6 d,e,f 5 2 a 4 5 b 7 a

d,e,f

13

a,c

14

a 15 d,e,f 13 c 14 b

Gomory-Hu Tree
10 e 8 d f 6 a,b,c 7

e,f 17 d 13

a 15 c 14 b

Gomory-Hu Tree
10 e f 9 8 a,b,c

18 e

f 17 d 13

a 15 14 c b

Gomory-Hu Tree
Proof
X v1 X

Y1 v2 Y2 v1 X

F(i, j) Min(via, vab, , vdj) F(i, j) Min(via, vab, , vdj)