Boosting node activity by recommendations in social networks

DOI10.1007/S10878-020-00629-6zbMath1466.91240OpenAlexW3045833488MaRDI QIDQ2023132

Shengminjie Chen, Wenguo Yang, Sui-Xiang Gao, Ruidong Yan

Publication date: 3 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00629-6

zbMATH Keywords

greedy algorithmsandwich methodactivity probabilitynon-submodularity

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Related Items (1)

Novel algorithms for maximum DS decomposition

Uses Software

• SNAP
• TIFIM

Cites Work

• Scalable influence maximization for independent cascade model in large-scale social networks
• TIFIM: a two-stage iterative framework for influence maximization in social networks
• Maximizing Social Influence in Nearly Optimal Time

This page was built for publication: Boosting node activity by recommendations in social networks