Influence maximization in the presence of vulnerable nodes: a ratio perspective

DOI10.1016/j.tcs.2020.11.020zbMath1480.91170OpenAlexW3102692731MaRDI QIDQ2220831

Grigorios Loukides, Hau Chan, Solon P. Pissis, Huiping Chen

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/30316

zbMATH Keywords

social networksinfluence maximizationvulnerable nodes

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Uses Software

• SIMPATH

Cites Work

• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Recommending links through influence maximization
• Scalable influence maximization for independent cascade model in large-scale social networks
• Submodular Approximation: Sampling-based Algorithms and Lower Bounds
• Introduction to Information Retrieval
• An analysis of approximations for maximizing submodular set functions—I
• Submodular Maximization with Cardinality Constraints
• Automata, Languages and Programming

This page was built for publication: Influence maximization in the presence of vulnerable nodes: a ratio perspective