Webinar on 6/8/2022: SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra

Tim Davis, Ph.D., Professor at the Department of Computer Science and Engineering, Texas A&M University, presented the webinar titled “SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra” at 3 pm CDT on June 8, 2022.

Dr. Davis has mentioned that “Power systems are themselves a graph (an object with nodes and edges). Every time a linear system is solved that comes from a power system problem, graph algorithms are used to solve it.” A review paper shows also some examples here. Another relevant paper is linked here.


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. Key features and performance of the SuiteSparse implementation of GraphBLAS package are described. The implementation appears in Linux distros, forms the basis of the RedisGraph module of Redis (a commercial graph database system), and appears as C=A*B in MATLAB. Graph algorithms written in GraphBLAS can rival the performance of highly-tuned specialized kernels, while being far simpler for the end user to write.


Tim Davis is a Professor in the Computer Science and Engineering Department at Texas A&M University. His primary scholarly contribution is the creation of widely-used sparse matrix algorithms and software (including x=A\b in MATLAB). Davis is a Fellow of SIAM, ACM, and IEEE.

Slides and Recording

The slides are posted here. The video recording is available here.