Tag
csr
- Sep 26, 2026 Adjacency Lists, Matrices, and the Cost of Asking Who Is Adjacent How adjacency matrices, per-vertex lists, and compressed sparse row arrays differ in memory, neighbour iteration, and edge lookup, and which graph shapes favour each. algorithms
- Mar 13, 2026 Compressed Sparse Row Storage and the Cost of Insertion How three flat arrays encode a sparse matrix, why the matrix-vector product is limited by memory rather than arithmetic, and why assembly happens in a different format. scientific computing