AI RESEARCH
Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study
arXiv CS.LG
•
ArXi:2605.21510v1 Announce Type: cross Reference-based graph compression encodes each vertex's neighbor list relative to a recent vertex, exploiting locality to compress large directed graphs. The dominant tool, WebGraph's BVGraph, fixes a single encoding pipeline and relies on a separately chosen vertex ordering -- typically URL-lexicographic or Layered Label Propagation (LLP). The interaction between ordering and encoder is rarely measured.