A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks

A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks | Litlas