A Fine-Grained Structural Partitioning Approach to Graph Compression - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Fine-Grained Structural Partitioning Approach to Graph Compression

Résumé

To compress a graph, some methods rely on finding highly compressible structures, such as very dense subgraphs, and encode a graph by listing these structures compressed. However, structures can overlap, leading to encoding the same information multiple times. The method we propose deals with this issue, by identifying overlaps and encoding them only once. We have tested our method on various realworld graphs. The obtained results show that our approach is efficient and outperforms state of the art methods. The source code of our algorithms, together with some sample input instances, are available at https://gitlab.liris.cnrs.fr/fpitois/fgsp.git.
Fichier non déposé

Dates et versions

hal-04194761 , version 1 (04-09-2023)

Identifiants

Citer

François Pitois, Hamida Seba, Mohammed Haddad. A Fine-Grained Structural Partitioning Approach to Graph Compression. The 25th International Conference on Big Data Analytics and Knowledge Discovery (DAWAK 2023), Aug 2023, Penang, Malaysia, Malaysia. pp.392-397, ⟨10.1007/978-3-031-39831-5_36⟩. ⟨hal-04194761⟩
36 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More