Title of article :
Impact of a varying capacity on the all pairs 2-route network flows
Author/Authors :
Diallo، نويسنده , , Madiagne and Gueye، نويسنده , , Serigne and Berthomé، نويسنده , , Pascal، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
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.
Keywords :
multiroute flows , 2-route flows , parametric flows , 2-cut-tree , Sensitivity analysis , cut-tree , multi-terminal
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
