HardGraph Algorithms
Social Network Influence Maximization
Given a social network graph, find the k most influential users to seed a viral marketing campaign, maximizing expected reach.
Constraints
Network has 1M+ nodes. Use Independent Cascade or Linear Threshold model.
Examples & Scenarios