| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652444 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
