Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra

DOI10.1145/3322125MaRDI QIDQ4960968zbMATH OpenOpenAlexWikidataFDO

Authors Timothy A. Davis

Publication date 24 April 2020

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3322125

zbMATH Keywords

graph algorithmssparse matrices

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Implementing sparse matrices for graph algorithms
• New ideas in sparse matrix matrix multiplication
• Parallel mapping of sparse computations
• Algorithm 692: Model implementation and test package for the Sparse Basic Linear Algebra Subprograms
• JGraphT—A Java Library for Graph Data Structures and Algorithms

Cited in

(7)

• Implementing sparse matrices for graph algorithms
• SuiteSparse.GraphBLAS
• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
• A fractal eigenvector
• Exact hierarchical reductions of dynamical models via linear transformations
• Algorithm 1037: SuiteSparse:GraphBLAS: parallel graph algorithms in the language of sparse linear algebra
• High-performance statistical computing (HPSC): challenges, opportunities, and future directions

Describes a project that uses

Uses Software

• SNAP
• SparseMatrix
• RedisGraph
• GraphMat
• GraphBLAS
• GraphPad Prism
• Graphulo

This page was built for publication: Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960968)