Papers › Graph Compression Using The Regularity Method
Graph Compression Using The Regularity Method
Francesco Pelosin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We are living in a world which is getting more and more interconnected and, as physiological effect, the interaction between the entities produces more and more information. This high throughput generation calls for techniques able to reduce the volume of the data, but still able to preserve the carried knowledge. Data compression and summarization techniques are one of the possible approaches to face such problems. The aim of this thesis is to devise a new pipeline for compressing and decompressing a graph by exploiting Szemer\'edi's Regularity Lemma. In particular, it has been developed a procedure called CoDec (Compression-Decompression) which is based on Alon et al's constructive version of the Regularity Lemma. We provide an extensive experimental evaluation to measure how robust is the framework as we both corrupt the structures carried by the graph and add noisy edges among them. The experimental results make us confident that our method can be effectively used as a graph compression technique able to preserve meaningful patterns of the original graph.
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