Implementing sparse matrices for graph algorithms

MaRDI QIDQ3108697zbMATH OpenFDO

Authors Aydin Buluç, J. R. Gilbert, Viral B. Shah

Publication date 5 January 2012

zbMATH Keywords

random access memorycompressed sparse row

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra
• Sparse Matrices in MATLAB: Design and Implementation
• Computational Science - ICCS 2004
• scientific article; zbMATH DE number 3874478
• Direct Methods for Sparse Linear Systems

Cited in

(6)

• Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
• Efficient data structures for sparse network representation
• High performance rearrangement and multiplication routines for sparse tensor arithmetic
• Measuring Segregation via Analysis on Graphs
• scientific article; zbMATH DE number 3874478 (Why is no real title available?)
• Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra

This page was built for publication: Implementing sparse matrices for graph algorithms

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