Skip to main content
. Author manuscript; available in PMC: 2013 Feb 1.
Published in final edited form as: Math Biosci. 2011 Nov 16;235(2):138–147. doi: 10.1016/j.mbs.2011.11.006

Figure 3.

Figure 3

The fraction of susceptible nodes saved from infection under the optimal partition (solid line) and the QCQP approach (dashed line) in Erdős-Renyi random graphs, as a function of the link probability p and for different link removal constraints K. The performance bound derived from the SDP is shown for each case (dotted line). Evaluated over 5,000 random networks of 15 nodes with 5 infected nodes.