Now a day’s many researchers have been researching on how to find most influential nodes in a network, especially in social networks. If we are given a social network where neighbors can influence other nodes of a network then to identify some such seed nodes in social network through which we can maximize the spread of influence is recent research topic. In this paper we are working on weighted greedy algorithm and modifying it to get better results
Influence maximization, social network, spread of influence, independent cascade model, and greedy algorithm