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

DOI10.1145/3577195MaRDI QIDQ6601389zbMATH OpenWikidataFDO

Authors Timothy A. Davis

Publication date 10 September 2024

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

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

zbMATH Keywords

graph algorithmsGraphBLASsparse matrices

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
• A survey of direct methods for sparse linear systems
• Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra
• Direct Methods for Sparse Linear Systems
• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
• scientific article; zbMATH DE number 2000185 (Why is no real title available?)
• scientific article; zbMATH DE number 5937963 (Why is no real title available?)
• Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
• Sparse Matrices in MATLAB: Design and Implementation
• The University of Florida sparse matrix collection
• Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition

This page was built for publication: Algorithm 1037: SuiteSparse:GraphBLAS: parallel 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 Q6601389)