Parallel Breadth-first Search
Parallel Breadth-First Search is a parallel tree algorithm that extends the breadth-first search strategy by concurrently exploring multiple nodes at each level of a tree or graph using multiple processors or computing threads, thereby reducing overall execution time.
41
Publications
1.8K
Citations
105
Authors
57
Institutions
Publications per year
2017–2026
5
Variants
Parallel Bfs
41
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Andrew S. Yoo, Edmond Chow, Keith Henderson et al. · 2005 · 261 citations · Full text
Parallel breadth-first search on distributed memory systems
Aydın Buluç, Kamesh Madduri · 2011 · 226 citations
Large-scale parallel breadth-first search
Richard E. Korf, Peter Schultze · 2005 · 104 citations
1–5 of 41
105
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 105
57
Tokyo Institute of Technology
Tokyo, Japan
4 h-index
8 publications
246 citations

Lawrence Berkeley National Laboratory
Berkeley, United States
3 h-index
6 publications
500 citations
Indiana University Bloomington
Bloomington, United States
3 h-index
6 publications
274 citations
Kyushu University
Fukuoka, Japan
3 h-index
4 publications
127 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
3 publications
118 citations

Masaryk University
Brno, Czechia
2 h-index
6 publications
144 citations
Sandia National Laboratories
Albuquerque, United States
1 h-index
2 publications
522 citations
Instituto Tecnológico de Chetumal
Chetumal, Mexico
1 h-index
1 publications
22 citations
1–8 of 57
Conference · 1 publications · 45 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 10 citations
1
h-index
TSE · 1 publications · 17 citations
1
h-index
ENTCS · 1 publications · 15 citations
1
h-index
1–5