Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra
205
stars
209
commits
Nov 20, 2025
updated
Notation:
[BFS] Optimal algebraic Breadth-First Search for sparse graphs (preprint, 2019) by Paul Burkhardt[BFS] Implementing Push-Pull Efficiently in GraphBLAS (ICPP 2018) by Carl Yang, Aydın Buluç, John D. Owens
[BFS] A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS (HPEC 2020) by Márton Elekes et al.
[DFS] Linear Algebraic Depth-First Search (ARRAY workshop @ PLDI 2019) by Daniele G. Spampinato et al.
[SSSP] Delta-Stepping SSSP: From Vertices and Edges to GraphBLAS Implementations (GrAPL @ IPDPS 2019) by Upasana Sridhar et al.
[CC] Parallel algorithms for finding connected components using linear algebra (Journal of Parallel and Distributed Computing 2020) by Yongzhe Zhang, Ariful Azad, Aydın Buluç[CC] FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence (PP 2020) by Yongzhe Zhang, Ariful Azad, Zhenjiang Hu[CC] LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory (IPDPS 2019) by Ariful Azad and Aydın Buluçlibsuitesparse-dev package. For example, Ubuntu 20.04's default repository contains SuiteSparse:GraphBLAS 3.2.0.See also the ongoing design of the GraphBLAS C++ API and its rgri reference implementation.
You can also find many papers, posters, and presentations in the Accumulo repository.
| year | IPDPS workshop | HPEC |
|---|---|---|
| 2023 | GrAPL 2023 | HPEC 2023 |
| 2022 | GrAPL 2022 | HPEC 2022 |
| 2021 | GrAPL 2021 | HPEC 2021 |
| 2020 | GrAPL 2020 | HPEC 2020 |
| 2019 | GrAPL 2019 | HPEC 2019 |
| 2018 | GABB 2018 | HPEC 2018 |
| 2017 | GABB 2017 | HPEC 2017 |
| 2016 | GABB 2016 | HPEC 2016 |
| 2015 | GABB 2015 | HPEC 2015 |
| 2014 | GABB 2014 | HPEC 2014 |
| 2013 | − | HPEC 2013 |
The nicematrix LaTeX package can be used to typeset block matrices.
The source of this page is available at https://github.com/GraphBLAS/GraphBLAS-Pointers.
Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra
205
stars
209
commits
Nov 20, 2025
updated
Notation:
[BFS] Optimal algebraic Breadth-First Search for sparse graphs (preprint, 2019) by Paul Burkhardt[BFS] Implementing Push-Pull Efficiently in GraphBLAS (ICPP 2018) by Carl Yang, Aydın Buluç, John D. Owens
[BFS] A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS (HPEC 2020) by Márton Elekes et al.
[DFS] Linear Algebraic Depth-First Search (ARRAY workshop @ PLDI 2019) by Daniele G. Spampinato et al.
[SSSP] Delta-Stepping SSSP: From Vertices and Edges to GraphBLAS Implementations (GrAPL @ IPDPS 2019) by Upasana Sridhar et al.
[CC] Parallel algorithms for finding connected components using linear algebra (Journal of Parallel and Distributed Computing 2020) by Yongzhe Zhang, Ariful Azad, Aydın Buluç[CC] FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence (PP 2020) by Yongzhe Zhang, Ariful Azad, Zhenjiang Hu[CC] LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory (IPDPS 2019) by Ariful Azad and Aydın Buluçlibsuitesparse-dev package. For example, Ubuntu 20.04's default repository contains SuiteSparse:GraphBLAS 3.2.0.See also the ongoing design of the GraphBLAS C++ API and its rgri reference implementation.
You can also find many papers, posters, and presentations in the Accumulo repository.
| year | IPDPS workshop | HPEC |
|---|---|---|
| 2023 | GrAPL 2023 | HPEC 2023 |
| 2022 | GrAPL 2022 | HPEC 2022 |
| 2021 | GrAPL 2021 | HPEC 2021 |
| 2020 | GrAPL 2020 | HPEC 2020 |
| 2019 | GrAPL 2019 | HPEC 2019 |
| 2018 | GABB 2018 | HPEC 2018 |
| 2017 | GABB 2017 | HPEC 2017 |
| 2016 | GABB 2016 | HPEC 2016 |
| 2015 | GABB 2015 | HPEC 2015 |
| 2014 | GABB 2014 | HPEC 2014 |
| 2013 | − | HPEC 2013 |
The nicematrix LaTeX package can be used to typeset block matrices.
The source of this page is available at https://github.com/GraphBLAS/GraphBLAS-Pointers.