Influence maximization: near-optimal time complexity meets practical efficiency

SIGMOD Conference, pp. 75-86, 2014.

Cited by: 566|Views190
EI

Abstract:

Given a social network G and a constant $k$, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model. This problem finds important applications in viral marketing, and has been extensively studied in the literature. Existing algorithm...More

Code:

Data:

Your rating :
0

 

Tags
Comments