Scribd
Upload
13 views3 pages

Sheet 7: Problem

The document contains 4 problems involving maximum flow algorithms. Problem 1 asks to find the maximum flow in a network using Ford-Fulkerson. Problem 2 tests understanding of maximum flow concepts and asks about cuts in a network. Problem 3 solves a maximum flow problem using the labeling algorithm. Problem 4 uses the labeling algorithm on an undirected network.

Uploaded by

nada abdelrahman
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
13 views3 pages

Sheet 7: Problem

The document contains 4 problems involving maximum flow algorithms. Problem 1 asks to find the maximum flow in a network using Ford-Fulkerson. Problem 2 tests understanding of maximum flow concepts and asks about cuts in a network. Problem 3 solves a maximum flow problem using the labeling algorithm. Problem 4 uses the labeling algorithm on an undirected network.

Uploaded by

nada abdelrahman
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

Sheet 7

Problem (1)
Consider the following network G, where the initial flow in the network = 0, find the
maximum flow from S to T by applying the Ford-Fulkerson algorithm.

0, 5
A B 0, 7
0, 10
2

8 T
0,

S 0,

C D
0, 10
0, 8
0, 10

Problem (2)
(I) Which of the following claims are true and which are false? Correct the false
statement if exists.
(a) Residual network contains only the arcs with non-negative residual capacity.
(b) The maximum flow from the source A to the sink M equals to the
maximum capacity among all A-M cuts.
(c) The value of any flow is less than or equal to the capacity of any cut in the
network.
(II) Consider the network shown below;

-1-
(a) Specify four s-t cuts in the network, each containing four forward arcs. List the
Capacity, residual capacity, and the flow across each cut.
(b) Draw the residual network for the given network and list all augmenting paths
from node s to node t.

Problem (3)
Solve the maximum flow problem in the following figure by labelling algorithm,
augmenting flow along the longest path in the residual network (i.e. the path containing the
maximum number of arcs).

o Specify the residual network before each augmentation.


o After every augmentation, decompose the flow into flows along directed paths from
node s to node t. o Finally, specify the minimum cut in the network obtained by the
labeling algorithm.

-2-
Problem (4)
Use the labeling algorithm to establish a maximum flow in the given undirected network.
Show the residual network at the end of each augmentation and specify the minimum cut
that the algorithm obtain when it terminates.

-3-

You might also like