Community based acceptance probability maximization for target users on social networks: algorithms and analysis
From MaRDI portal
Publication:2283014
DOI10.1016/J.TCS.2019.07.032zbMATH Open1443.91250OpenAlexW2969877065WikidataQ127354496 ScholiaQ127354496MaRDI QIDQ2283014FDOQ2283014
Authors: Ruidong Yan, Yuqing Zhu, Deying Li, Yongcai Wang 
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.07.032
Recommendations
Cites Work
- Reducibility among combinatorial problems
- The Complexity of Enumeration and Reliability Problems
- An analysis of approximations for maximizing submodular set functions—I
- Ranking the spreading ability of nodes in complex networks based on local structure
- Community-based acceptance probability maximization for target users on social networks
Cited In (7)
- CrawISN: community-aware data acquisition with maximum willingness in online social networks
- An individual-based model of information diffusion combining friends' influence
- Boosting node activity by recommendations in social networks
- Multi-attribute based influence maximization in social networks: algorithms and analysis
- Multi-attribute based influence maximization in social networks
- Community-based acceptance probability maximization for target users on social networks
- Target users' activation probability maximization with different seed set constraints in social networks
Uses Software
This page was built for publication: Community based acceptance probability maximization for target users on social networks: algorithms and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283014)
