Research Article

Underestimated Cost of Targeted Attacks on Complex Networks

Table 2

DCFE, that is, the area under the curve of the size of the GCC after attacking by different algorithms. is short for site percolation, for bond percolation, Betw for betweenness, and Bridg for bridgeness. The best performing algorithm in each row is emphasized in bold.

DCFE HDHDAEGPCIMin-SumCoreHDBPDBetwBridgHPI-Ncut

PB0.6380.9200.8610.6190.6570.7260.8150.7220.8430.5970.9100.278
PH0.6270.6770.6960.7470.6870.6750.7360.6610.8170.5360.6890.224
PG0.3710.2600.2930.2630.2190.1300.2560.1130.3050.1450.4200.014
AS0.5670.5760.6040.5920.5670.5670.5760.5610.6050.5270.6180.192
ER0.6010.5470.6470.5020.4410.2680.6470.2470.7530.3870.5420.032
SF ()0.6190.7000.7060.6710.6500.6360.6600.6320.6830.6720.6940.342
SF ()0.4060.2310.2280.3430.2140.2020.2270.1920.2980.3120.3520.092
SBM0.4870.4190.3780.3970.3480.2840.3740.2740.3840.3480.5120.075