Papers › Graph Compression: Toward a Generalized Algorithm
Graph Compression: Toward a Generalized Algorithm
Daniel Szelogowski
Currently, most graph compression algorithms focus on in-memory compression (such as for web graphs) – few are feasible for external compression, and there is no generalized approach to either task. These compressed representations are versatile and can be applied to a great number of different applications, with the most common being social network and search systems. We present a new set of compression approaches, both lossless and lossy, for external memory graph compression. These new algorithms may also be applicable for runtime usage (i.e., running graph algorithms on the compressed representation).
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections