|
|
|
|
|
Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su and Huan X. Hoang
The Influence Maximization (????
IM
) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number of influenced nodes after propagation process is maximized, is an important problem in in...
ver más
|
|
|
|
|