|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|