A two-stage Leiden+LLP ordering saves 0.3-5.4 bits per edge on poorly ordered graphs across encoders, while new BG/CS/CG encoders improve over BVGraph high-compression by 2-9%.
Brisaboa, Susana Ladra, and Gonzalo Navarro
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study
A two-stage Leiden+LLP ordering saves 0.3-5.4 bits per edge on poorly ordered graphs across encoders, while new BG/CS/CG encoders improve over BVGraph high-compression by 2-9%.