Algorithm 1000: SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra Academic Article

abstract

• SuiteSparse:GraphBLAS is a full implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring. An overview of the GraphBLAS specification is given, followed by a description of the key features and performance of its implementation in the SuiteSparse:GraphBLAS package.

authors

• Davis, Timothy

published proceedings

• ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

altmetric score

• 1

author list (cited authors)

• Davis, T. A.

citation count

• 53

complete list of authors

• Davis, Timothy A

publication date

• January 2019

publisher

• Association for Computing Machinery (ACM)  Publisher

published in

• ACM Transactions on Mathematical Software  Journal

keywords

• Graph Algorithms
• Graphblas
• Sparse Matrices

Digital Object Identifier (DOI)

• 10.1145/3322125

start page

• 1

end page

• 25

volume

• 45

issue

• 4

URL

• http://dx.doi.org/10.1145/3322125