Skip to main content

Table 3 Summary benchmark results comparing PBIL [ 19 ], degree and PageRank-based sequential algorithms, and the proposed greedy approach

From: Efficiently identifying critical nodes in large complex networks

Problem | V | | E | K PBIL Degree PageRank Greedy
ErdosRenyi 235 350 50 6,700 1,086 1,953 3,011
ErdosRenyi 466 700 80 44,255 9,299 25,892 28,994
ErdosRenyi 941 1,400 140 225,576 123,947 113,752 116,135
ErdosRenyi 2,344 3,500 200 2,009,132 1,851,950 1,708,603 1,395,584
BarabasiAlbert 500 499 50 892 202 236 199
BarabasiAlbert 1,000 999 75 3,057 622 689 559
BarabasiAlbert 2,500 2,499 100 28,044 4,258 4,808 3,726
BarabasiAlbert 5,000 4,999 150 146,753 13,038 13,971 10,216
WattsStrogatz 250 1,246 70 13,768 16,110 16,110 16,110
WattsStrogatz 500 1,496 125 53,779 70,125 62,149 69,751
WattsStrogatz 1,000 4,996 200 308,596 319,600 319,600 319,600
WattsStrogatz 1,500 4,498 265 703,241 761,995 700,474 761,995
ForestFire 250 514 50 886 547 403 217
ForestFire 500 828 110 1,904 902 490 293
ForestFire 1,000 1,817 150 9,594 7,796 2,609 1,414
ForestFire 2,000 3,413 200 12,569 27,451 11,419 5,002
  1. Italic values indicate best solution per problem instance. Problem instances are those in [19].