CGS greedily merges nodes with common neighborhoods into three configurable summary variants that bound neighborhood loss and support exact or high-accuracy graph queries without full decompression.
A Survey on Methods and Systems for Graph Compression
1 Pith paper cite this work, alongside 20 external citations. Polarity classification is still indexing.
1
Pith paper citing it
20
external citations · Pith
abstract
We present an informal survey (meant to accompany another paper) on graph compression methods. We focus on lossless methods, briefly list available pproaches, and compare them where possible or give some indicators on their compression ratios. We also mention some relevant results from the field of lossy compression and algorithms specialized for the use on large graphs. --- Note: The comparison is by no means complete. This document is a first draft and will be updated and extended.
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
CGS: Configurable Graph Summarization with Bounded Neighborhood Loss and Query Support
CGS greedily merges nodes with common neighborhoods into three configurable summary variants that bound neighborhood loss and support exact or high-accuracy graph queries without full decompression.