DBScholar

Back to papers

Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened

Summary: Efficient random RR-set generation for IC accelerates IM; runtime becomes O(k n log n / epsilon^2) with bounded in-degree. Reduces RR-set size to boost scalability in high-influence networks while preserving (1 - 1/e - epsilon); experiments show orders-of-magnitude speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hebb76a8f65a17941
Venue
SIGMOD
Year
2020
Pagerank
8.7070902e-05
Overall Rank
2,278 | 84.69%
DOI
10.1145/3318464.3389740

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{guo_sigmod20,
        title = {{Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened}},
        author = {Guo, Qintian and Wang, Sibo and Wei, Zhewei and Chen, Ming},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3389740},
        url = {https://dl.acm.org/doi/10.1145/3318464.3389740},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 17 of 17 citing papers.

Rank Citing Paper Year Venue Pagerank
7,445 Analysis of Influence Contribution in Social Advertising 2022 VLDB 5.5247739e-05
7,602 Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks 2023 SIGMOD 5.4868396e-05
7,913 Triangular Stability Maximization by Influence Spread over Social Networks 2023 VLDB 5.4277727e-05
7,971 Minimizing the Regret of an Influence Provider 2021 SIGMOD 5.4150644e-05
8,603 Scapin: Scalable Graph Structure Perturbation by Augmented Influence Maximization 2023 SIGMOD 5.3049212e-05
8,978 Efficient and Effective Algorithms for Revenue Maximization in Social Advertising 2021 SIGMOD 5.2448813e-05
9,416 Minimum Vertex Augmentation 2021 VLDB 5.1804375e-05
9,635 Optimal Dynamic Parameterized Subset Sampling 2024 PODS 5.146966e-05
9,952 Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint 2025 VLDB 5.1038322e-05
9,963 Fast and Space-Efficient Parallel Algorithms for Influence Maximization 2024 VLDB 5.1038322e-05
10,600 Time-Critical Influence Minimization via Node Blocking 2026 SIGMOD 4.9793485e-05
10,682 Robust Fair Influence Maximization under Multiple Community Partitions 2026 SIGMOD 4.9793485e-05
10,871 Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection 2026 VLDB 4.9793485e-05
11,554 Influence Maximization via Vertex Countering 2024 VLDB 4.9793485e-05
11,663 Host Profit Maximization: Leveraging Performance Incentives and User Flexibility 2024 VLDB 4.9793485e-05
11,723 Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach 2023 SIGMOD 4.9793485e-05
12,037 Towards an Efficient Weighted Random Walk Domination 2021 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers