GPU-Accelerated Graph Analytics for Irregular Security Graphs
A reproducible empirical study of GPU acceleration strategies (BFS, PageRank, WCC, Louvain) on skewed, power-law graphs — five optimization tiers from sequential C++ to load-balanced CUDA, benchmarked from 8M to 268M edges, with every speedup attributed to one named technique and every negative result kept.