Reference no: EM1352863
Suppose that we allow a flow network to have negative (as well as positive) edge capacities. In such a network, a feasible flow need not exist.
(a)Consider an edge (u, v) in a flow network G = (V, E) with c(u, v) < 0. Briefly explain what such a negative capacity means in terms of the flow between u and v.
Let G = (V, E) be a flow network with negative edge capacities, and let s and t be the source and sink of G. Construct the ordinary flow network G' = (V', E') with capacity function c', source s', and sink t', where
V' = V ∪ {s', t'} and
E' = E ∪ {(u, v) : (v, u) ∈ E}
∪ {(s', v) : v ∈ V}
∪ {(u, t') : u ∈ V}
∪ {(s, t), (t, s)}
We assign capacities to edges as follows. For each edge (u, v) ∈ E, we set
c'(u, v) = c'(v, u) = (c(u, v) + c(v, u))/2 .
For each vertex u ∈ V, we set
c' (s', u) = max(0, (c(V, u) - c(u, V))/2)and
c'(u, t') = max(0, (c(u, V) - c(V, u))/2) .
We also set c'(s, t) = c'(t, s) = ∞.
( b )Prove that if a feasible flow exists in G, then all capacities in G' are nonnegative and a maximum flow exists in G' such that all edges into the sink t' are saturated.
( c ) Prove the converse of part ( b ). Your proof should be constructive, that is, given a flow in G' that saturates all the edges into t', your proof should show how to obtain a feasible flow in G.
( d ) Describe an algorithm that finds a maximum feasible flow in G. Denote by MF(|V|, |E|) the worst-case running time of an ordinary maximum flow algorithm on a graph with |V| vertices and |E| edges. Analyze your algorithm for computing the maximum flow of a flow network with negative capacities in terms of MF.
Design algorithm based on bfs that colors a graph
: Design an algorithm based on BFS that either colors a graph with 2 colors or determines that two colors are not sufficient.
|
What must be the stantard deviation per 100 ft tape lenght
: An oscillating LC circuit has a current amplitude of 7.50 mA, a potential amplitude of 250 mV, and the capacitance of 220 nF. What are (a) the period of oscillation.
|
Fund balances to governmental activities changes net assets
: A governmental funds Statement of Revenues, Expenditures, and Changes in Fund Balances reported expenditures of $33,500,000, including capital outlay expenditures of $3,200,000.
|
Explain what are the disadvantages to a virtual company
: Explain What are the disadvantages to a virtual company in using Vermont as their state of incorporation and Why, Explain How and What are the advantages? Why? How?
|
Describe algorithm that finds maximum feasible flow in graph
: Describe an algorithm that finds a maximum feasible flow in G. Denote by MF(|V|, |E|) the worst-case running time of an ordinary maximum flow algorithm.
|
Example on organizational communication
: Describe how organizations within the same industry may have different values. For example, why was a company such as Enron riddled with corruption while other energy companies never developed these types of problems?
|
Possible explanations for people aggression and hatred
: Please name and briefly describe two of the many possible explanations for people's aggression and hatred.
|
Construct a portfolio to provide for returns
: You have received $1 million from your uncle's estate and have been provided the opportunity to invest in stocks or bonds.
|
Find how long the sled takes to travel from a to b
: On a cool morning, when the temperature is 14.0 ^circC, you measure pressure in your car tires to be 20.0 psi. After driving 40.0 mi on the freeway, the temperature of your tires is 50.0 ^circC.
|