Maximum flow and cut theorem

A question is this type if and only if it asks to deduce information about maximum flow using the relationship between flows and cuts, typically applying the max-flow min-cut theorem.

1 questions · Moderate -0.5

Sort by: Default | Easiest first | Hardest first
AQA D2 2013 January Q4
6 marks Moderate -0.5
4
  1. When investigating three network flow problems, a student finds:
    1. a flow of 50 and a cut with capacity 50 ;
    2. a flow of 35 and a cut with capacity 50 ;
    3. a flow of 50 and a cut with capacity 35 . In each case, write down what the student can deduce about the maximum flow.
  2. The diagram below shows a network. The numbers on the arcs represent the minimum and maximum flow along each arc respectively. By considering the flow at an appropriate vertex, explain why a flow is not possible through this network. \includegraphics[max width=\textwidth, alt={}, center]{3ba973a1-6a45-4381-b634-e9c4673ef1fb-10_1189_1559_1105_246}
    (2 marks)