Skip to main content
Journal of Big Data

Table 6 Runtime of algorithms on netphy 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)

2.67

2.7

4.67

0.60

2.08

2.15

141.15

Back to article page