Clique covering of large real-world networks

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01388477
Contributor : Marie-France Sagot <>
Submitted on : Friday, June 16, 2017 - 3:31:38 PM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM
Long-term archiving on : Wednesday, December 13, 2017 - 4:45:06 PM

File

edgeclique.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

181

Files downloads

144