INCIM: A community-based algorithm for influence maximization problem under the linear threshold model
With the proliferation of graph applications in social network analysis, biological networks, WWW and many other areas, a great demand of efficient and scalable algorithms for graph mining is rising. In many applications, finding the most influential nodes in the network is informative for the network analyzers in order to track the spread of information, disease and rumors. The problem of finding the top k influential nodes of a directed graph G=(V,E) such that the influence spread of these...[Show more]
|Collections||ANU Research Publications|
|Source:||Information Processing & Management|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.