hbs7(1) - 3 Let G = V E be a graph For each edge e let d e...

Info icon This preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 473 HBS 7 Spring 2009 CS 473: Undergraduate Algorithms, Spring 2009 HBS 7 1. Let G = ( V , E ) be a directed graph with non-negative capacities. Give an efficient algorithm to check whether there is a unique max-flow on G? 2. Let G = ( V , E ) be a graph and s , t V be two specific vertices of G . We call ( S , T = V \ S ) an ( s , t ) -cut if s S and t T . Moreover, it is a minimum cut if the sum of the capacities of the edges that have one endpoint in S and one endpoint in T equals the maximum ( s , t ) -flow. Show that, both intersection and union of two min-cuts is a min-cut itself.
Image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3. Let G = ( V , E ) be a graph. For each edge e let d ( e ) be a demand value attached to it. A flow is feasible if it sends more than d ( e ) through e . Assume you have an oracle that is capable of solving the maximum flow problem. Give efficient algorithms for the following problems that call the oracle at most once. (a) Find a feasible flow. (b) Find a feasible flow of minimum possible value. 1...
View Full 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