Shared-memory Graph Algorithms

Shared-Memory Graph Algorithms is a class of parallel graph algorithms designed to operate on shared-memory multiprocessor systems, where multiple processing units concurrently access and modify a common graph data structure to exploit data locality and reduce communication overhead inherent in distributed-memory models.

69

Publications

5.1K

Citations

198

Authors

87

Institutions

Publications per year

2017–2026

23

Authors

198

  1. JS
    Julian Shun

    Carnegie Mellon University, United States

    7 publications · 1.4K citations

    7

    h-index

  2. DA
    David A. Bader

    Georgia Institute of Technology, United States

    5 publications · 289 citations

    5

    h-index

  3. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    4 publications · 1.3K citations

    4

    h-index

  4. MH
    Mahantesh Halappanavar

    Pacific Northwest National Laboratory, United States

    3 publications · 104 citations

    3

    h-index

  5. FM
    Fredrik Manne

    University of Bergen, Norway

    3 publications · 134 citations

    3

    h-index

1–5 of 198

Venues

  1. arXiv (Cornell University)

    Repository · 4 publications · 248 citations

    4

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 4 publications · 158 citations

    4

    h-index

  3. Algorithmica

    2 publications · 177 citations

    2

    h-index

  4. Communications of the ACM

    2 publications · 474 citations

    2

    h-index

  5. 1

    h-index

1–5