Solving the Maximal Clique Problem on Compressed Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Solving the Maximal Clique Problem on Compressed Graphs

Bernard Jocelyn
Hamida Seba

Abstract

The Maximal Clique Enumeration problem (MCE) is a graph problem encountered in many applications such as social network analysis and computational biology. However, this problem is difficult and requires exponential time. Consequently, appropriate solutions must be proposed in the case of massive graph databases. In this paper, we investigate and evaluate an approach that deals with this problem on a compressed version of the graphs. This approach is interesting because compression is a staple of massive data processing. We mainly show, through extensive experimentations, that besides reducing the size of the graphs, this approach enhances the efficiency of existing algorithms.
No file

Dates and versions

hal-01886654 , version 1 (03-10-2018)

Identifiers

Cite

Bernard Jocelyn, Hamida Seba. Solving the Maximal Clique Problem on Compressed Graphs. 24th International Symposium on Methodologies on Intelligent ( ISMIS 2018), Oct 2018, LImassol, Cyprus. pp.45-55, ⟨10.1007/978-3-030-01851-1_5⟩. ⟨hal-01886654⟩
92 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More