Sciweavers

NETWORKS
2007
13 years 10 months ago
The maximum residual flow problem: NP-hardness with two-arc destruction
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
Donglei Du, R. Chandrasekaran