Publication | Closed Access

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

Computational Social ScienceNetwork ScienceEngineeringNetwork AlgorithmInfluence MaximizationNetwork AnalysisFrog-leaping AlgorithmSocial InfluenceInformation DiffusionInformation PropagationCombinatorial OptimizationInfluence ModelSocial Network AggregationInfluential NodesSocial Network Analysis