Structure prediction and computation of sparse matrix products
From MaRDI portal
Publication:1288468
DOI10.1023/A:1009716300509zbMath0960.65046OpenAlexW1557602349MaRDI QIDQ1288468
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
algorithmnumerical examplessparse matricesmatrix multiplicationstructure predictionsize estimationnonzero structure
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ Spatially-decaying aggregation over a network ⋮ A fast output-sensitive algorithm for Boolean matrix multiplication ⋮ Better size estimation for sparse matrix products ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph ⋮ The parallelism motifs of genomic data analysis
This page was built for publication: Structure prediction and computation of sparse matrix products
