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

Authors

105

  1. KF
    Katsuki Fujisawa

    Tokyo Institute of Technology, Japan

    4 publications · 153 citations

    4

    h-index

  2. AL
    Andrew Lumsdaine

    Indiana University Bloomington, United States

    3 publications · 137 citations

    3

    h-index

  3. AB
    Aydın Buluç

    Lawrence Berkeley National Laboratory, United States

    3 publications · 250 citations

    3

    h-index

  4. TS
    Toyotaro Suzumura

    Tokyo Institute of Technology, Japan

    3 publications · 104 citations

    3

    h-index

  5. LB
    Luboš Brim

    Masaryk University, Czechia

    2 publications · 48 citations

    2

    h-index

1–5 of 105

Venues

  1. 1

    h-index

  2. Optics and Lasers in Engineering

    1 publications · 22 citations

    1

    h-index

  3. 1

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 1 publications · 17 citations

    1

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 15 citations

    1

    h-index

1–5