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.
Clique covering of large real-world networks / Conte Alessio; Grossi Roberto; Marino Andrea. - STAMPA. - 04-08-:(2016), pp. 1134-1139. (Intervento presentato al convegno 31st Annual ACM Symposium on Applied Computing, SAC 2016 tenutosi a ita nel 2016) [10.1145/2851613.2851816].
Clique covering of large real-world networks
Grossi Roberto;Marino Andrea
2016
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.I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.