Research on the Dynamic Multisocial Networks Influence Maximization Problem Based on Common Users
The influence maximization problem of a single social network is to find a set of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> seed nodes <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inli...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2021-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9536717/ |