Skip to main content

Table 5 Comparing the run times (in milliseconds) of each approach

From: Efficiently identifying critical nodes in large complex networks

Problem Slow greedy SEQ Degree PageRank Authority MIS
Conmat 1,732,841 21,229 379 16,810 26,027 126,101,000
Ego 7,036 2,129 92 1,480 3,750 111,931,000
Flight 10,199 207 25 144 231 3,273,000
Powergrid 29,896 252 41 288 3,470 22,292,000
Relativity 43,679 421 44 180 601 43,016,000
Oclinks 2,301 143 11 114 360 1,734,000
  1. The proposed greedy approach is considered for both cases of using the queue-based strategy (fast greedy) or not (slow greedy).