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.