Scalable Triangle Counting in Massive Graphs using GPU Acceleration

Implemented parallel intersection-based triangle counting using CUDA thread-level optimizations.

Optimized adjacency list traversal with memory coalescing techniques.

Reduced redundant computations using degree-based node ordering heuristics.

Benchmarked scalability across increasing graph sizes and compared with CPU-based baselines.