method that can approximate the influence spread of the greedy algorithm as close as possible.
-
Notifications
You must be signed in to change notification settings - Fork 0
diaohaiyao/influence-maximization-algorithms
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
method that can approximate the influence spread of the greedy algorithm as close as possible.
Resources
Stars
Watchers
Forks
Releases
No releases published