Skip to main content

Table 3 The running time of our algorithm under the IC model on Nethept data for K = 50

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

RND d-hops

UERND D-hops

Time (s)

3.17

4.45

4.21

1.4E−2

5.02

1.216

232.15

53.19