Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
- 15 July 2026
- book chapter
- Published by Springer Nature
- p. 423-436
Abstract
No abstract availableAll Related Versions
This publication has 22 references indexed in Scilit:
- Think globally, act locally: On the optimal seeding for nonsubmodular influence maximizationInformation and Computation, 2022
- Don’t Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization2017
- Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescenceJournal of Combinatorial Optimization, 2016
- On Bharathi–Kempe–Salek conjecture for influence maximization on arborescenceJournal of Combinatorial Optimization, 2016
- On Budgeted Influence Maximization in Social NetworksIEEE Journal on Selected Areas in Communications, 2013
- Scalable Influence Maximization in Social Networks under the Linear Threshold Model2010
- Submodularity of Influence in Social Networks: From Local to GlobalSIAM Journal on Computing, 2010
- Epidemic dynamics and endemic states in complex networksPhysical Review E, 2001
- Social Ties and Word-of-Mouth Referral BehaviorJournal of Consumer Research, 1987
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978