A novel meta‐heuristic approach for influence maximization in social networks

B Chatterjee, T Bhattacharyya, KK Ghosh… - Expert …, 2023‏ - Wiley Online Library
Influence maximization in a social network focuses on the task of extracting a small set of
nodes from a network which can maximize the propagation in a cascade model. Though …

Social media in emerging economies: A cross-cultural comparison

TF Stafford, BQ Duong - IEEE Transactions on Computational …, 2022‏ - ieeexplore.ieee.org
Social media are increasingly popular, worldwide, and when social media technologies
extend from the Western markets in which they were developed into the Eastern markets …

A unified greedy approximation for several dominating set problems

H Zhong, Y Tang, Q Zhang, R Lin, W Li - Theoretical computer science, 2023‏ - Elsevier
Abstract Minimum Dominating Set and Minimum Connected Dominating Set are classic
graph problems that have been studied extensively in the literature. These two problems …

Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks

H Zhong, W Li, Q Zhang, R Lin… - IEEE Transactions on …, 2025‏ - ieeexplore.ieee.org
Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce
positive effect with the minimal cost on a social network. The purpose of this article is to …

Formulating the dynamics of an online community and identifying the influential members using the animal flocking model

JS Chang, GH Wang - Electronic Commerce Research and Applications, 2021‏ - Elsevier
To provide effective decision support for online community management, this study
proposes new methods for formulating community dynamics and identifying influential …

Enhance rumor controlling algorithms based on boosting and blocking users in social networks

X Yao, N Gao, C Gu, H Huang - IEEE Transactions on …, 2022‏ - ieeexplore.ieee.org
It is undeniable that rumors abound on online social networks and rumors can cause many
disastrous consequences. Effective controlling of rumors is of great significance in social …

[HTML][HTML] Connected positive influence dominating set in k-regular graph

X Yao, H Huang, H Du - Discrete Applied Mathematics, 2020‏ - Elsevier
The positive influence dominating set (PIDS) problem is a well-known APX-hard problem
and there exists a greedy approximation algorithm with an approximation ratio of H (δ) …