This preview shows pages 1–9. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Multiterminal Network Flow
___/————— Given a network, pick a source—sink pair . Solve the network flow problem times, where all other nodes are reay 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 NGtWOI’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.
 Fall '06
 Hu
 Algorithms

Click to edit the document details