maxFlow-capacityex - Engineering Exercises 1. Describe (in...

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

View Full Document Right Arrow Icon
Engineering xercises 2. How would you modify your algorithm in the last Exercises 1. Describe (in words) an algorithm for finding k edge- isjoint paths joining a given pair of vertices in a problem to find a set of k vertex-disjoint paths (a set of paths is vertex-disjoint if no vertex appears on more than one path – excepting the initial and final vertices in the path). disjoint paths joining a given pair of vertices in a directed graph. (A set of paths is edge-disjoint if no edge appears in both paths). Let s and t be the given pair of vertices. Treat the graph as flow network with all edges having capacity 1 Now find We can use the same approach to find vertex-disjoint paths. We first must create a new graph having vertices u 1 , u 2 for each vertex u in the original graph. For each pair u 1 , u 2 , we include an edge (u 1 ,u 2 ) and for each edge v in the original graph we add an edge (u v in the a flow network with all edges having capacity 1. Now find a maximum flow in the graph from s to t. If the capacity of
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

maxFlow-capacityex - Engineering Exercises 1. Describe (in...

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

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