Back to papers
Fast and Space-Efficient Parallel Algorithms for Influence Maximization
Summary: PaC-IM introduces sketch-compression for the independent cascade model on undirected graphs, combining simulation and sketching to realize a tunable time–space tradeoff. New parallel seed-selection data structures deliver 5–18× speedups and 1.4–3.8× memory reduction, scaling to 978M nodes/75B edges in ≈2h.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13600
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.1945683e-05
- Overall Rank
- 11,080 | 22.92%
- DOI
-
10.14778/3623093.3632104
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 180 |
Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency |
2014 |
SIGMOD |
0.00037135181 |
| 337 |
Influence Maximization in Near-Linear Time: A Martingale Approach |
2015 |
SIGMOD |
0.00027011645 |
| 1,652 |
Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study |
2017 |
SIGMOD |
0.00011010086 |
| 2,486 |
Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks |
2020 |
VLDB |
8.6741469e-05 |
| 2,664 |
Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened |
2020 |
SIGMOD |
8.3512717e-05 |
| 4,165 |
Grain: Improving Data Efficiency of Graph Neural Networks via Diversified Influence Maximization |
2021 |
VLDB |
6.3921956e-05 |
| 6,158 |
The Solution Distribution of Influence Maximization: A High-level Experimental Study on Three Algorithmic Approaches |
2020 |
SIGMOD |
5.1800945e-05 |
| 6,669 |
Influence Maximization in Real-World Closed Social Networks |
2023 |
VLDB |
4.9677027e-05 |
| 7,396 |
Collective Influence Maximization for Multiple Competing Products with an Awareness-to-Influence Model |
2021 |
VLDB |
4.7419296e-05 |
| 7,871 |
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms |
2021 |
VLDB |
4.6308128e-05 |
| 8,003 |
Analysis of Influence Contribution in Social Advertising |
2022 |
VLDB |
4.6085729e-05 |
| 9,249 |
Hindering Influence Diffusion of Community |
2022 |
SIGMOD |
4.3690661e-05 |
| 11,191 |
Parallel Strong Connectivity Based on Faster Reachability |
2023 |
SIGMOD |
4.1945683e-05 |
Semantically Similar Papers