An efficient exact algorithm for triangle listing in large graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Data Mining and Knowledge Discovery Année : 2016

An efficient exact algorithm for triangle listing in large graphs

Résumé

This paper presents a new efficient exact algorithm for listing triangles in a large graph. While the problem of listing triangles in a graph has been considered before, dealing with large graphs continues to be a challenge. Although previous research has attempted to tackle the challenge, this is the first contribution that addresses this problem on a compressed copy of the input graph. In fact, the proposed solution lists the triangles without decompressing the graph. This yields interesting improvements in both storage requirement of the graphs and their time processing.
Fichier principal
Vignette du fichier
DMKD-seba-2017.pdf (437.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01265036 , version 1 (06-05-2020)

Identifiants

Citer

Sofiane Lagraa, Hamida Seba. An efficient exact algorithm for triangle listing in large graphs. Data Mining and Knowledge Discovery, 2016, 30 (5), ⟨10.1007/s10618-016-0451-4⟩. ⟨hal-01265036⟩
259 Consultations
487 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More