Scribd
Upload
4 views3 pages

Problem Sets123

The document presents a series of problems related to network flow, including maximum flow calculation using the Ford-Fulkerson algorithm, identifying minimum cuts, constructing residual graphs, and analyzing network bottlenecks. Each problem requires specific calculations and proofs related to flow networks. The final problem asks for a theoretical proof of the Max-Flow Min-Cut Theorem.

Uploaded by

jeloidelosa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views3 pages

Problem Sets123

The document presents a series of problems related to network flow, including maximum flow calculation using the Ford-Fulkerson algorithm, identifying minimum cuts, constructing residual graphs, and analyzing network bottlenecks. Each problem requires specific calculations and proofs related to flow networks. The final problem asks for a theoretical proof of the Max-Flow Min-Cut Theorem.

Uploaded by

jeloidelosa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

--

Problem 1: Maximum Flow Calculation

(s)

10 8

(a) (b)
--

5 7

(c) (d)
3

4 9

(t)
Find the maximum flow from the source s to the sink t using the Ford-
Fulkerson algorithm. Show all residual graphs for each iteration.

Problem 2: Identifying Minimum Cut


For the same network in Problem 1, determine the minimum cut. Specify the
two sets S and T that form the cut and compute its capacity.

Problem 3: Residual Graph and Augmenting Path


For the following flow netwSork with given flows and capacities:

1
(s)

4/6 5/7

(a) (b)

2/3 3/5

(c) (d)
1/4

6/7

(t)

1. Construct the residual graph.


2. Identify an augmenting path and update the residual graph.

Problem 4: Network Bottleneck and Feasible Flow


Given the following flow network:

2
(s)

10 7

(a) (b)

4 6

(c) (d)
5

(t)

1. Find the bottleneck of the augmenting paths used in a Ford-Fulkerson


iteration.

2. Find a feasible flow that satisfies the capacity and flow conservation con-
straints.

Problem 5: Theoretical Proof - Max-Flow Min-


Cut Theorem
Prove that in any flow network, the maximum flow is always equal to the mini-
mum cut using a formal proof.

You might also like