Rumor correction maximization problem in social networks

DOI10.1016/j.tcs.2021.02.014zbMath1500.91105OpenAlexW3128085024MaRDI QIDQ1998850

Wenguo Yang, Ding-Zhu Du, Yapu Zhang

Publication date: 9 March 2021

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.014

zbMATH Keywords

approximation ratioboost nodesrumor correctionseed nodes

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (3)

Multi-attribute based influence maximization in social networks: algorithms and analysis ⋮ Fixed observation time-step: adaptive influence maximization ⋮ Adaptive influence maximization under fixed observation time-step

Uses Software

• SNAP

Cites Work

• Viral marketing of online game by DS decomposition in social networks
• Complete submodularity characterization in the comparative independent cascade model
• The Complexity of Enumeration and Reliability Problems
• An analysis of approximations for maximizing submodular set functions—I
• A simple model of global cascades on random networks
• An Optimal Algorithm for Monte Carlo Estimation
• Reducibility among Combinatorial Problems
• Maximizing Social Influence in Nearly Optimal Time

This page was built for publication: Rumor correction maximization problem in social networks