Skip to Main content Skip to Navigation

Résolution de problèmes de cliques dans les grands graphes

Jocelyn Bernard 1 Hamida Seba 1
1 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : The MCE (Maximal Clique Enumeration) and MCP (Maximum Clique Problem) are problems that are encontred in data graph analyses and mining. However, these problems are consequently difficult (NP-hard for MCE and NP-complete for MCP). Consequently, appropriate solutions must be proposed in the case of large graphs. We propose in this work to answer these problems by working on a compressed version of the original graph. This approach seems interesting both in terms of computation time and memory space. So we implemented our approach and we compared with several solutions from the literature.
Document type :
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Jocelyn Bernard <>
Submitted on : Tuesday, March 8, 2016 - 6:26:03 PM
Last modification on : Wednesday, July 8, 2020 - 12:43:49 PM
Long-term archiving on: : Sunday, November 13, 2016 - 9:46:46 AM


Files produced by the author(s)


  • HAL Id : hal-01284640, version 1


Jocelyn Bernard, Hamida Seba. Résolution de problèmes de cliques dans les grands graphes. [Rapport de recherche] LIRIS. 2015. ⟨hal-01284640⟩



Record views


Files downloads