Skip to main content

Table 4 Runtime of algorithms on Nethept data for K = 50 under the LT model

From: Selection of top-K influential users based on radius-neighborhood degree, multi-hops distance and selection threshold

Algorithm Degree PageRank Degree discount heuristic BCT TIM+ IMM UERND D-hops
Time (s) 0.67 0.59 0.78 8.993E−3 2.03 1.09 31