Optimizing network robustness via Krylov subspaces
ESAIM: Mathematical Modelling and Numerical Analysis, vol. 58, pp. 131–155, 2024
We consider the problem of attaining either the maximal increase or reduction of the robustness of a complex network by means of a bounded modification of a subset of the edge weights. We propose two novel strategies combining Krylov subspace approximations with a greedy scheme and with the limited-memory BFGS. The …