Structure prediction and computation of sparse matrix products

DOI10.1023/A:1009716300509MaRDI QIDQ1288468zbMATH OpenOpenAlexFDO

Authors Edith Cohen

Publication date 8 February 2001

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009716300509

zbMATH Keywords

algorithmmatrix multiplicationnonzero structurenumerical examplessize estimationsparse matricesstructure prediction

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• On optimizing multiplications of sparse matrices
• Predicting Structure in Sparse Matrix Computations
• A note on the multiplication of sparse matrices
• scientific article; zbMATH DE number 554767

Cited in

(9)

• Separators and structure prediction in sparse orthogonal factorization
• A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph
• Automatic Nonzero Structure Analysis
• Predicting Structure in Sparse Matrix Computations
• The parallelism motifs of genomic data analysis
• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
• A fast output-sensitive algorithm for Boolean matrix multiplication
• On sparse matrix chain products
• Spatially-decaying aggregation over a network

This page was built for publication: Structure prediction and computation of sparse matrix products

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