BFSBlitz: A Highly Parallel Graph System for Breadth-First Search
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 (ORCID: https://orcid.org/0009-0006-7586-4753)
- Ashkan Vedadi Gargary (ORCID: https://orcid.org/0009-0004-2128-5735)
Institutions
- University of California, Riverside (US)
Publication Details
- Published
- 2025-03-01
- DOI
- https://doi.org/10.1145/3711708.3723444
- Primary Topic
- Graph Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00