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 5.

Figure 5

The fraction of small-world graphs, Θ, for which the QCQP approach finds an optimal partition (as confirmed by exhaustive search) as a function of the re-wiring probability, q, and for different link removal constraints, K. Evaluated over 5,000 sample small-world graphs of 15 nodes with 5 infected nodes.