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

DOI10.1145/3577195WikidataQ130912018 ScholiaQ130912018MaRDI QIDQ6601389

Timothy A. Davis

Publication date: 10 September 2024

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

zbMATH Keywords

sparse matricesgraph algorithmsGraphBLAS

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The university of Florida sparse matrix collection
• Direct Methods for Sparse Linear Systems
• A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
• Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
• Sparse Matrices in MATLAB: Design and Implementation
• Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
• Algorithm 1000
• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
• A survey of direct methods for sparse linear systems

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)