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

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

View Full Document Right Arrow Icon
Engineering Exercises 2. How would you modify your algorithm in the last 1. Describe (in words) an algorithm for finding k edge- disjoint 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). 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 a 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 (u 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
Image of page 1

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

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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern