Shrink: Distance preserving graph compression

Amin Sadri, Flora D. Salim, Yongli Ren, Masoomeh Zameni, Jeffrey Chan, Timos Sellis

Abstract: Highlights•We present a graph compression method that preserves distances between the nodes.•It is applicable to weighted and unweighted graphs (e.g. road and social network).•Distance-based queries can be run without decompression.•The user can control a trade-off between accuracy and compression ratio.•The complexity is linear in the number of nodes, |V|, when the average degree σ ≪|V|.