Hbs8 - CS 473 Algorithms Fall 2010 HBS 8 Problem 1[Go With the Flow The figure below shows a flow network along with a flow In the figure the

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: CS 473: Algorithms, Fall 2010 HBS 8 Problem 1. [Go With the Flow] The figure below shows a flow network along with a flow. In the figure, the notation a/b for an edge means that the flow on the edge is a and the capacity of the edge is b. 4/4 a b 9/13 6/10 3/4 s c 5/7 2/2 d 7/7 e 2/4 5/8 0/3 t 2/2 5/5 (a) What is the value of the given flow? Is it maximal? Show the residual graph for the above graph and flow in the figure below. a b s c t d e (b) Show an s − t path in the residual graph and state its bottleneck capacity. You only need to draw the path from the graph you showed in (a). a b s c t d e 1 (c) Show the new flow on the original graph after augmenting on the path you found in (b). Use the notation a/b to indicate the flow on an edge and its capacity. 4/4 a b 9/13 6/10 3/4 s c 5/7 2/2 d 7/7 e d e 2/4 5/8 0/3 t s c t a b 2/2 5/5 (d) What is the capacity of a minimum-cut in the given graph? Find a cut with that capacity. Problem 2. [Residual Graph Properties] Prove the following property about residual graphs: Let f be a flow in G and Gf be the residual graph. If f is a flow in Gf , then f + f is a flow in G of value v (f ) + v (f ). Problem 3. [Capacities on Nodes] In a standard s − t maximum flow problem, we assume that edges have capacities, and there is no limit on how much flow is allowed to pass through a node. In this problem, we consider the variant where nodes have capacities. Let G = (V, E ) be a directed graph with source s and sink t. Let c : V → R+ be a capacity function. Recall that a flow f assigns a flow value f (e) to each edge e. A flow f is feasible if the total flow into every vertex v is at most c(v ): f in (v ) ≤ c(v ) for every vertex v Design a polynomial time algorithm that finds a feasible s − t flow of maximum value in G. 2 ...
View Full Document

This note was uploaded on 01/22/2011 for the course CS 473 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

Page1 / 2

Hbs8 - CS 473 Algorithms Fall 2010 HBS 8 Problem 1[Go With the Flow The figure below shows a flow network along with a flow In the figure the

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