Impact of a varying capacity on the all pairs 2-route network flows

Given an undirected edge-weighted network in which one edge capacity is allowed to vary, we propose in this paper a polynomial algorithm that needs only two 2-cut-trees computations to provide the all pairs maximum 2-route flow values.