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
1.1K
PowerGraph: distributed graph-parallel computation on natural graphs
Joseph E. Gonzalez, Yucheng Low, Haijie Gu et al. · 2012 · 1.5K citations
Julian Shun, Guy E. Blelloch · 2013 · 808 citations
A scalable processing-in-memory accelerator for parallel graph processing
Junwhan Ahn, Sungpack Hong, Sungjoo Yoo et al. · 2015 · 761 citations
1–5 of 1.1K
2.2K
22
h-index
17
h-index
17
h-index
15
h-index
15
h-index
1–5 of 2.2K
591
Carnegie Mellon University
Pittsburgh, United States
28 h-index
79 publications
16.2K citations
Georgia Institute of Technology
Atlanta, United States
25 h-index
104 publications
5.1K citations

Lawrence Berkeley National Laboratory
Berkeley, United States
20 h-index
44 publications
2.6K citations
IBM (United States)
Armonk, United States
19 h-index
49 publications
3.8K citations
National University of Singapore
Singapore, Singapore
19 h-index
53 publications
2.4K citations

Pacific Northwest National Laboratory
Richland, United States
18 h-index
55 publications
1.8K citations
The University of Texas at Austin
Austin, United States
18 h-index
71 publications
3.8K citations

Peking University
Beijing, China
17 h-index
41 publications
3.4K citations
1–8 of 591
TPDS · 41 publications · 1.8K citations
26
h-index
PVLDB · 35 publications · 2.7K citations
25
h-index
22 publications · 2.6K citations
20
h-index
Repository · 25 publications · 607 citations
14
h-index
14 publications · 471 citations
13
h-index
1–5