Algorithm 1 Evaluating performance of link removal algorithms for a given network A and 300 sets of initially infected nodes, ℐ.

for each link removal algorithm do

for K = 0 to Kmax do

for m = 1 to 300 do

s0(i) = 1 ∀ i ∈ ℐm

s0(i) = 0 ∀ i ∉ ℐm

% Identify set of links to remove, ℒ, according to link removal algorithm, f(·). %

ℒ = f(A, s0, K)

à = A

Ãij = Ãji = 0 ∀ (i, j) ∈ ℒ

for n = 1 to 100 do

Simulate disease spread with network à and initial heath state vector, s0 (see Algorithm 2). Returns final outbreak size, ninf.

Ninf (n) = ninf

end for

$P_{\mathit{\text{inf}}}(m)=\frac{1}{100}{\sum }_{n=1}^{100}{N}_{\mathit{\text{inf}}}(n)$

end for

return ${\overline{P}}_{\mathit{\text{inf}}}(K)=\frac{1}{300}{\sum }_{m=1}^{300}{P}_{\mathit{\text{inf}}}(m)$

end for

Plot P̄inf (K) as function of link removal budget K to generate result plots.

end for