Jul 2026
Extended Depth-First Representations of k2-trees
In this paper, we study static, computation-friendly, lossless compression formats for graphs, focusing on memory locality and operational efficiency of $k^2$-trees. We observe that their traditional level-wise layouts suffer from poor cache performance due to weak locality, especially in operations such as matrix-vect...
Gabriel Carmona, P. Ferragina, Giovanni Manzini et al.
· arXiv.org · 0 citations