Maximization Influence Flow Using Modified Greedy Algorithm

Jyoti Ran
2017 International Journal Of Engineering And Computer Science  
The influence maximization problem is of finding a set of seed nodes in social network through which we can maximize the spread of influence. These seed nodes can be used in online marketing so as to maximize the profit. Marketers can get particular group of customers through online market. In this paper we are modifying greedy algorithm so as to maximize results of influence maximization.
doi:10.18535/ijecs/v6i1.39 fatcat:ubitwtglrjek5ne4vxu4ibcbde