lect notes-multi-terminal-network-flow

lect notes-multi-terminal-network-flow - Multi-terminal...

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

View Full Document Right Arrow Icon
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Multi-terminal Network Flow ___/————— Given a network, pick a source—sink pair . Solve the network flow problem times, where all other nodes are re|ay nodes, and flow is conserved ’f/ CSE 202, May 4, 2006 — 1/9 Multi—terminal' Network Flow . * MAX FLOW m, j) MAX FLOW F(j,k) MAX FLOW F(7L, k.) II II II NOON CSE 202, May 4, 2006 - 2/9 Floweequivalent, Network ' MAX FLOW F(7:,j) = 7 MAX FLOW m, k) :- 8 MAX FLOW m, k) = 7 Flow—equivalent ____________________——————-—-—— CSE 202, May 4. 2006 — 3 / 9 Lemma In Multi—terminal Flows: For any i,j, k: _ CSE 202, May 4, 2006 — 4/9 Lemma CSE 202, May 4, 2006 - 5 / 9 Must be distinct vaiues, when two values are the same the other one is larger I/i— CSE 202, May 4, 2006 — 6 / 9 There are at most 4 distinct values CSE 202, May 4, 2006 — 7/ 9 Lemma Proof: Select the ‘Iargest 4 values and form a tree CSE 202, May 4, 2006— 3 / 9 NG-tWOI’k . Flow- equivalent Network CSE 202, May 4, 2006 - 9 / 9 ...
View Full Document

This note was uploaded on 02/19/2008 for the course CSE 202 taught by Professor Hu during the Fall '06 term at UCSD.

Page1 / 9

lect notes-multi-terminal-network-flow - Multi-terminal...

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

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