86
Voted
NETWORKS
2007
15 years 2 months ago
2007
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...