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.
Title resolution pending
1 Pith paper cite this work, alongside 9 external citations. Polarity classification is still indexing.
1
Pith paper citing it
9
external citations · OpenAlex
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.