lect notes-Gomory-Hu Tree

lect notes-Gomory-Hu Tree - Gomory-Hu Tree Given n-node...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Gomory-Hu Tree •G iven n -node network •F ind F(i, j) = C(i, j) ji X’ X • For all nodes g Є X’ and all node h Є X –F(g, h) C(i, j)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Gomory-Hu Tree e i gh j 5 1 1 4 3 e, j, g i, h • F(i, e) = 5 • F(i, h) = 4 • F(j, h) = 2 2
Background image of page 2
Gomory-Hu Tree je 52 , g i , h , g i h 4 egi h 4 h 5
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Gomory-Hu Tree • Given a network of n nodes, there exists (n-1) Min Cuts separating the n nodes a e cd b f 1 1 2 6 5 1 3 7 1
Background image of page 4
Gomory-Hu Tree a e cd b f 1 1 2 6 5 1 3 7 1 a e b f 4 12 5 13 3
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Gomory-Hu Tree • Algorithm for G-H cut tree f a d c e b 4 10 8 2 2 3 4 5 2 7 3 d,e,f 13 a,b,c
Background image of page 6
Gomory-Hu Tree
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

lect notes-Gomory-Hu Tree - Gomory-Hu Tree Given n-node...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online