1 paper · 1 filter
Marati Bhaskar, Raghavendra Kanakagiri
Breadth-first search (BFS) is a fundamental graph algorithm that presents significant challenges for parallel implementation due to irregular memory access patterns, load imbalance…