Unformatted text preview: that there are no counterclockwise residual cycles in the residual graph G θ . 2. What price function φ would you use to get the same property as in (1), but with no clockwise residual cycles? 3. Use parts (1) and (2) to give a linear time algorithm that, given a ﬂow assignment γ in G makes γ acyclic by removing all ﬂow cycles in γ . That is, it produces another ﬂow assignment γ s.t. (a) γγ is a circulation (b) for every arc a , γ (( a, 1)) ≤ γ (( a, 1)) (c) for any cycle C there is a dart d ∈ C s.t. γ ( d ) ≤...
View
Full Document
 Fall '11
 ErikDemaine
 Algorithms, Graph Theory, γ, planar graphs, ﬂow assignment, residual cycles, counterclockwise residual cycles

Click to edit the document details