Breadth-first Search
Breadth-First Search is a graph traversal algorithm that explores nodes level by level, starting from a given source node and visiting all its neighbors before proceeding to their unvisited descendants.
635
Publications
37.9K
Citations
1.6K
Authors
611
Institutions
Publications per year
2017–2026
140
Parents
635
1–5 of 635
1.6K
10
h-index
8
h-index
7
h-index
7
h-index
7
h-index
1–5 of 1.6K
611
University of California, Los Angeles
Los Angeles, United States
11 h-index
17 publications
939 citations
The University of Texas at Austin
Austin, United States
10 h-index
21 publications
1K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
23 publications
756 citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
32 publications
2.1K citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
12 publications
337 citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
15 publications
6.2K citations
Tsinghua University
Beijing, China
9 h-index
15 publications
1.8K citations
IBM (United States)
Armonk, United States
8 h-index
16 publications
1.2K citations
1–8 of 611
10 publications · 1.9K citations
10
h-index
Repository · 10 publications · 229 citations
10
h-index
8 publications · 322 citations
8
h-index
Conference · 8 publications · 211 citations
8
h-index
7 publications · 266 citations
7
h-index
1–5