An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
Influence Maximization is to find a subset of influential nodes so that they can spread influence to the largest range in a network. The study on influence maximization is of great importance, and many solutions have been developed, including greedy algorithm which provides the provable approximate...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8847353/ |