A Survey on Methods and Systems for Graph Compression
Sebastian Maneth, Fabian Peternek

TL;DR
This survey reviews lossless graph compression methods, compares various approaches and their ratios, and discusses related lossy techniques and algorithms for large graphs, providing an overview of current methods.
Contribution
It offers an initial, informal overview of graph compression techniques, highlighting differences and performance indicators, serving as a foundation for future comprehensive surveys.
Findings
List of available lossless graph compression methods
Comparison indicators for different approaches
Discussion of lossy compression and large graph algorithms
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Algorithms and Data Compression · Data Management and Algorithms
