Influence Maximization Problem

Algorithm

Implement the algorithm described in “Influence Maximization in Near-Linear Time: A Martingale Approach”

Usage

$ python3 IMP.py -i <graph file path> -k <the number of seeds> -m <IC or LT> -t <termination time> 

Result

Input

e : 0.1

l : 1

seed_num : 50

Output

Estimated Diffusion : 1294-1298

Time (8 processes) : 3.5s