An efficient exact algorithm for triangle listing in large graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès 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 non déposé

Dates et versions

hal-01475515 , version 1 (23-02-2017)

Identifiants

  • HAL Id : hal-01475515 , version 1

Citer

Sofiane Lagraa, Hamida Seba. An efficient exact algorithm for triangle listing in large graphs . ECML-PKDD 2016, Sep 2016, Riva del Garda, Italy. ⟨hal-01475515⟩
231 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More