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

Authors

1.6K

  1. RE
    Richard E. Korf

    University of California, Los Angeles, United States

    10 publications · 515 citations

    10

    h-index

  2. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    8 publications · 409 citations

    8

    h-index

  3. KM
    Kamesh Madduri

    Pennsylvania State University, United States

    7 publications · 652 citations

    7

    h-index

  4. KF
    Katsuki Fujisawa

    Tokyo Institute of Technology, Japan

    7 publications · 251 citations

    7

    h-index

  5. MB
    Martin Burtscher

    Texas State University, United States

    7 publications · 384 citations

    7

    h-index

1–5 of 1.6K

Venues

  1. SIAM Journal on Computing

    10 publications · 1.9K citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 10 publications · 229 citations

    10

    h-index

  3. IEEE Transactions on Communications

    8 publications · 322 citations

    8

    h-index

  4. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 8 publications · 211 citations

    8

    h-index

  5. ACM SIGPLAN Notices

    7 publications · 266 citations

    7

    h-index

1–5