Question: This question is about maximum flows in a network in which the capacity of every edge is an even number. (a) Give an example a
This question is about maximum flows in a network in which the capacity of every edge is an even number.
(a) Give an example a maximal flow in such a network in which the flow through every edge is an integer,
but not all these integers are even.
(b) Explain why in every such network there exists a maximum flow in which the flow through every edge is an even number.

6. This question is about maximum flows in a network in which the capacity of every edge is an even number. (a) Give an example a maximal flow in such a network in which the flow through every edge is an integer, but not all these integers are even. (b) Explain why in every such network there exists a maximum flow in which the flow through every edge is an even number
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
