Efficient Network Dismantling via Node Explosive Percolation *

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

Fig. 1 (Color online) The relative size of the largest connected component $g$ in an ER graph with average degree $\langle k\rangle=4.0$ (a) and an RR graph with $k=4$ (b) with the fraction of removed node $\rho$. In these figures, we present the result of BPD algorithm (solid line), the ${\rm{NEP^1}}$ and ${\rm{NEP^2}}$ algorithm (dashed line and dotted line), and the ${\rm{NBA^1}}$ and ${\rm{NBA^2}}$ (dashed-dotted line and dashed-dotted-dotted line).