This preview shows pages 1–5. 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 Document
Unformatted text preview: CMSC 451: EdgeDisjoint Paths Slides By: Carl Kingsford Department of Computer Science University of Maryland, College Park Based on Section 7.6 of Algorithm Design by Kleinberg & Tardos. Edgedisjoint Paths Suppose you want to send k large files from s to t but never have two files use the same network link (to avoid congestion on the links). Leads naturally to the EdgeDisjoint Paths problem: k Edgedisjoint Paths Given directed graph G , and two nodes s and t , find k paths from s to t such that no two paths share an edge. Again a Reduction! Given an instance of kEdgeDisjoint Paths , Create an instance of Maximum Network Flow . The maximum flow will used to find the k edge disjoint paths. What is the maximum fow in the graph? Are there k edgedisjoint paths? Paths = Flow There is a nice correspondence between paths and flows in unit capacity networks. Suppose we had k edgedisjoint s t paths....
View
Full
Document
This note was uploaded on 01/13/2012 for the course CMSC 423 taught by Professor Staff during the Fall '07 term at Maryland.
 Fall '07
 staff

Click to edit the document details