Year: 2025
Type: conference-paper
Abstract: Breadth-First Search (BFS) is a fundamental graph traversal algorithm widely used in applications such as social network analysis, web crawling, and shortest path computations. However, efficiently parallelizing BFS for large-scale and irregular graph structures remains a significant challenge due to issues like workload imbalance, excessive synchronization, and data locality constraints.
Authors: Sakib Fuad, Ashkan Vedadi Gargary
Institution: University of California, Riverside
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W4410037166