LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS Conference Paper uri icon


  • 2019 IEEE. In 2013, we released a position paper to launch a community effort to define a common set of building blocks for constructing graph algorithms in the language of linear algebra. This led to the GraphBLAS. We released a specification for the C programming language binding to the GraphBLAS in 2017. Since that release, multiple libraries that conform to the GraphBLAS C specification have been produced. In this position paper, we launch the next phase of this ongoing community effort: a project to assemble a set of high level graph algorithms built on top of the GraphBLAS. While many of these algorithms are well-known with high quality implementations available, they have not been assembled in one place and integrated with the GraphBLAS. We call this project the LAGraph graph algorithms project and with this position paper, we put out a call for collaborators to join us. While the initial goal is to just assemble these algorithms into a single framework, the long term goal is a library of production-worthy code, with the LAGraph library serving as an open source repository of verified graph algorithms that use the GraphBLAS.

name of conference

  • 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

published proceedings


author list (cited authors)

  • Mattson, T., Davis, T. A., Kumar, M., Buluc, A., McMillan, S., Moreira, J., & Yang, C.

citation count

  • 27

complete list of authors

  • Mattson, Tim||Davis, Timothy A||Kumar, Manoj||Buluc, Aydin||McMillan, Scott||Moreira, Jose||Yang, Carl

publication date

  • May 2019