There is a newer version of this record available.

Presentation Open Access

Introduction to GraphBLAS: A linear algebraic approach for concise, portable, and high-performance graph algorithms

Gábor Szárnyas

This tutorial describes the theoretical background of GraphBLAS. First, we discuss the need for a standard for graph algorithms. Then, we define the key concepts in GraphBLAS such as sparse matrix multiplication, semirings, and masked matrix operations. We illustrate their usage through textbook graph algorithms including BFS, single-source shortest paths, triangle count, PageRank as well as more advanced graph algorithms such as community detection, local clustering coefficient, and bidirectional BFS. Finally, we provide a collection of GraphBLAS tools and resources for learning more about GraphBLAS.

Files (4.5 MB)
Name Size
graphblas-introduction.pdf
md5:925401298330da87bc5dd098d3489508
4.5 MB Download
2,149
1,420
views
downloads
All versions This version
Views 2,1492,017
Downloads 1,4201,266
Data volume 7.6 GB5.6 GB
Unique views 1,6621,591
Unique downloads 1,2221,123

Share

Cite as