Efficient Network Dismantling via Node Explosive Percolation *
|
Efficient Network Dismantling via Node Explosive Percolation * |
| Shao-Meng Qin,Xiao-Long Ren,Lin-Yuan Lü |
| Fig. 2 (Color online) The general efficiency $R$ for the ER graph (a), RR graph (b) and for SF graph with power-law exponent $\gamma=3.0$ (c) as the function of average degree $\langle k \rangle$. We present the results of BPD algorithm, ${\rm{NBA^1}}$, ${\rm{NBA^2}}$, the fast ${\rm{NBA^1}}$ and fast ${\rm{NBA^2}}$. (d), (e), and (f) are the relative improvement $r$ of these algorithms. |
|
|