Skip to main content

Table 5 Running time of our algorithm compared with existing work on netphy data for K = 50 under the IC model

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

Algorithm RND d-hops Degree PageRank Degree discount heuristic BCT TIM+ IMM UERND D-hops
Time (s) 3881.37 52.21 74.68 51.96 0.67 16.48 2.47 230.82