Joint Funds of the National Natural Science Foundation of China under Key Program under Grant U1713212; National Natural Science Foundation of China under Grants 61672358, 61572330, 61772393 and 61836005; Natural Science Foundation of Guangdong Province under grant 2017A030313338.10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 62173236 61803269 61876110 61806130 61976142 U1713212 62072315 61836005); 10.13039/501100003453-Natural Science Foundation of Guangdong Province (Grant Number: 2020A1515010790); Technology Research Project of Shenzhen City (Grant Number: JCYJ20190808174801673)
ABSTRACTIn recent years, one of the prominent research areas in the complex network field has been t...
Social networks are one the main sources of information transmission nowadays. However, not all node...
Graph is a basic mathematical tool that models information about identities as well as their complex...
International audienceThe problem of maximizing or minimizing the spreading in a social network has ...
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely u...
Influence maximization (IM) is the problem of finding a small subset of nodes in a social network so...
In the context of social networks, maximizing influence means contacting the largest possible number...
As the pervasiveness of social networks increases, new NP-hard related problems become interesting f...
The recent growth of emergent network applications (e.g., satellite networks, vehicular networks) is...
Online social networks have become an important platform for people to communicate, share knowledge ...
Influence maximization (IM) is the process of choosing a set of seeds from a social network so that ...
We live in a world of social networks. Our everyday choices are often influenced by social interacti...
The goal of this project was to find a better solution for the influence maximization problem in a f...
Influence maximization in a social network refers to the selection of node sets that support the fas...
Influence Maximization (IM), which aims to select a set of users from a social network to maximize t...
ABSTRACTIn recent years, one of the prominent research areas in the complex network field has been t...
Social networks are one the main sources of information transmission nowadays. However, not all node...
Graph is a basic mathematical tool that models information about identities as well as their complex...
International audienceThe problem of maximizing or minimizing the spreading in a social network has ...
Influence Maximization (IM) is a classical combinatorial optimization problem, which can be widely u...
Influence maximization (IM) is the problem of finding a small subset of nodes in a social network so...
In the context of social networks, maximizing influence means contacting the largest possible number...
As the pervasiveness of social networks increases, new NP-hard related problems become interesting f...
The recent growth of emergent network applications (e.g., satellite networks, vehicular networks) is...
Online social networks have become an important platform for people to communicate, share knowledge ...
Influence maximization (IM) is the process of choosing a set of seeds from a social network so that ...
We live in a world of social networks. Our everyday choices are often influenced by social interacti...
The goal of this project was to find a better solution for the influence maximization problem in a f...
Influence maximization in a social network refers to the selection of node sets that support the fas...
Influence Maximization (IM), which aims to select a set of users from a social network to maximize t...
ABSTRACTIn recent years, one of the prominent research areas in the complex network field has been t...
Social networks are one the main sources of information transmission nowadays. However, not all node...
Graph is a basic mathematical tool that models information about identities as well as their complex...