Parallel Graph Algorithms

Parallel Graph Algorithms is a class of computational methods designed to solve graph problems by simultaneously processing multiple graph elements across distributed or shared memory systems, distinguished by their explicit decomposition of graph operations to exploit concurrent execution while managing data dependencies and communication overhead inherent in parallel computation.

1.1K

Publications

60.6K

Citations

2.2K

Authors

591

Institutions

Publications per year

2017–2026

286

Authors

2.2K

  1. DA
    David A. Bader

    Georgia Institute of Technology, United States

    26 publications · 1.6K citations

    22

    h-index

  2. AB
    Aydın Buluç

    Lawrence Berkeley National Laboratory, United States

    22 publications · 1.4K citations

    17

    h-index

  3. JS
    Julian Shun

    Carnegie Mellon University, United States

    19 publications · 2.1K citations

    17

    h-index

  4. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    18 publications · 1.2K citations

    15

    h-index

  5. HJ
    Hai Jin

    Huazhong University of Science and Technology, China

    15 publications · 615 citations

    15

    h-index

1–5 of 2.2K

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 41 publications · 1.8K citations

    26

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 35 publications · 2.7K citations

    25

    h-index

  3. SIAM Journal on Computing

    22 publications · 2.6K citations

    20

    h-index

  4. arXiv (Cornell University)

    Repository · 25 publications · 607 citations

    14

    h-index

  5. Journal of Algorithms

    14 publications · 471 citations

    13

    h-index

1–5