Selecting the Most Influential Nodes in Social Networks

摘要

A set covering greedy algorithm is proposed for solving the influence maximization problem in social networks. Two information diffusion models are considered: Independent Cascade Model and Linear Threshold Model. The proposed algorithm is compared with t