Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Extended Depth-First Representations of -trees
Gabriel Carmona, Paolo Ferragina, Giovanni Manzini +1
In this paper, we study static, computation-friendly, lossless compression formats for graphs, focusing on memory locality and operational efficiency of -trees. We observe tha…
cs.DS2024
Toward Greener Matrix Operations by Lossless Compressed Formats
Francesco Tosoni, Philip Bille, Valerio Brunacci +3
Sparse matrix-vector multiplication (SpMV) is a fundamental operation in machine learning, scientific computing, and graph algorithms. In this paper, we investigate the space, time…