DBScholar

Back to papers

Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection

Summary: GAAS accelerates adaptive minimum-cost seed selection on GPUs via GmRR, a contention-avoiding circular mRR-set layout and balanced kernels. Reusing and theoretically updating mRR-sets yields up to 68.9× speedups with competitive seed costs. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID
h4187f3767c9b86af
Venue
VLDB
Year
2026
Pagerank
4.9605343e-05
Overall Rank
10,941 | 26.67%
DOI
10.14778/3836663.3836699
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{guo_vldb26,
        title = {{Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection}},
        author = {Guo, Gongyao and Feng, Chen and Li, Yiran and Shi, Jieming},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {11},
        pages = {3427--3439},
        doi = {10.14778/3836663.3836699},
        url = {https://doi.org/10.14778/3836663.3836699},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 21 of 21 cited papers.

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

Rank Cited Paper Year Venue Pagerank
187 Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency 2014 SIGMOD 0.00025945191
305 Influence Maximization in Near-Linear Time: A Martingale Approach 2015 SIGMOD 0.00021567807
441 Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks 2016 SIGMOD 0.00018233755
1,396 Online Processing Algorithms for Influence Maximization 2018 SIGMOD 0.00010774759
2,171 Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened 2020 SIGMOD 8.9117572e-05
2,698 Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks 2020 VLDB 8.1020179e-05
2,797 iBFS: Concurrent Breadth-First Search on GPUs 2016 SIGMOD 7.9831781e-05
3,320 Revisiting the Stop-and-Stare Algorithms for Influence Maximization 2017 VLDB 7.4137064e-05
3,657 Realtime Top-k Personalized PageRank over Large Graphs on GPUs 2020 VLDB 7.1105244e-05
4,635 Efficient Algorithms for Adaptive Influence Maximization 2018 VLDB 6.4757053e-05
5,164 Efficient Load-Balanced Butterfly Counting on GPU 2022 VLDB 6.2343301e-05
5,669 Efficient Approximation Algorithms for Adaptive Seed Minimization 2019 SIGMOD 6.0271116e-05
8,519 Efficient Influence Minimization via Node Blocking 2024 VLDB 5.3100264e-05
8,628 Scapin: Scalable Graph Structure Perturbation by Augmented Influence Maximization 2023 SIGMOD 5.2848769e-05
8,822 GPH: An Efficient and Effective Perfect Hashing Scheme for GPU Architectures 2025 SIGMOD 5.2549263e-05
8,846 Fast and Space-Efficient Parallel Algorithms for Influence Maximization 2024 VLDB 5.2498988e-05
9,106 Efficient Approximation Algorithms for Minimum Cost Seed Selection with Probabilistic Coverage Guarantee 2024 SIGMOD 5.208561e-05
9,692 Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach 2023 SIGMOD 5.1258854e-05
9,993 Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint 2025 VLDB 5.0845476e-05
9,996 Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment 2025 VLDB 5.0845476e-05
10,000 Everest: GPU-Accelerated System For Mining Temporal Motifs 2024 VLDB 5.0845476e-05
Previous Page 1 / 1 Next

Semantically Similar Papers