Clique covering of large real-world networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Clique covering of large real-world networks

(1) , (1, 2) , (1)
1
2

Abstract

The edge clique covering (ecc) problem deals with discovering a set of (possibly overlapping) cliques in a given network, such that each edge is part of at least one of these cliques. We address the ecc problem from an alternative perspective reconsidering the quality of the cliques found, and proposing more structured criteria with respect to the traditional measures such as minimum number of cliques. In the case of real-world networks, having millions of nodes, such as social networks, the possibility of getting a result is constrained to the running time, which should be linear or almost linear in the size of the network. Our algorithm for finding eccs of large networks has linear-time performance in practice, as our experiments show on real-world networks whose number of nodes ranges from thousands to several millions.
Fichier principal
Vignette du fichier
edgeclique.pdf (2.94 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01388477 , version 1 (16-06-2017)

Identifiers

Cite

Alessio Conte, Roberto Grossi, Andrea Marino. Clique covering of large real-world networks. 31st Annual ACM Symposium on Applied Computing (SAC 2016), Apr 2016, Pisa, Italy. pp.1134-1139, ⟨10.1145/2851613.2851816⟩. ⟨hal-01388477⟩

Collections

INRIA INRIA2
99 View
101 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More