Proceedings/Recueil Des Communications Année : 2009

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

Résumé

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.

Dates et versions

hal-02463995 , version 1 (02-02-2020)

Identifiants

Citer

Madiagne Diallo, Serigne Gueye, Pascal Berthomé. Impact of a varying capacity on the all pairs 2-route network flows. V Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. 35, Elsevier, pp.59-64, 2009, Electronic Notes in Discrete Mathematics, ⟨10.1016/j.endm.2009.11.011⟩. ⟨hal-02463995⟩
105 Consultations
0 Téléchargements

Altmetric

Partager

  • More