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.