Four depth-first k²-tree layouts (EDF-1, BP, CEDF, CBP), with suffix/LCP subtree compression, improve compression and matrix-operation locality over level-wise and DFUDS baselines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Extended Depth-First Representations of $k^2$-trees
Four depth-first k²-tree layouts (EDF-1, BP, CEDF, CBP), with suffix/LCP subtree compression, improve compression and matrix-operation locality over level-wise and DFUDS baselines.