A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks
Influence maximization problem aims to select a subset of k most influential nodes from a
given network such that the spread of influence triggered by the seed set will be maximum …
given network such that the spread of influence triggered by the seed set will be maximum …
[PDF][PDF] A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks
J Tang, R Zhang, P Wang, Z Zhao, L Fan… - Knowledge-Based …, 2020 - fardapaper.ir
abstract Influence maximization problem aims to select a subset of k most influential nodes
from a given network such that the spread of influence triggered by the seed set will be …
from a given network such that the spread of influence triggered by the seed set will be …