Abstract: Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid solvers, and randomized ...
Abstract: For accelerating the convergence of numerical computation of sparse matrices, the classical approach is to partition sparse matrices into block-diagonal structures by graph partitioning ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback