Efficient Network Dismantling via Node Explosive Percolation *

Shao-Meng Qin,Xiao-Long Ren,Lin-Yuan Lü

Fig. 3 (Color online) The comparison of the general efficiency $R$ between the BPD algorithm and ${\rm{NBA^1}}$ (a) and ${\rm{NBA^2}}$ (b) in the function of the number of reordered nodes $T$ on ER, RR, and SF graphs with different degrees. The power-law exponent $\gamma=3.0$ for the SF graph.