https://hal.inria.fr/hal-01388477Conte, AlessioAlessioConteDI - Dipartimento di Informatica [Pisa] - University of Pisa - Università di Pisa Grossi, RobertoRobertoGrossiDI - Dipartimento di Informatica [Pisa] - University of Pisa - Università di Pisa ERABLE - Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale - Inria Grenoble - Rhône-Alpes - Inria - Institut National de Recherche en Informatique et en AutomatiqueMarino, AndreaAndreaMarinoDI - Dipartimento di Informatica [Pisa] - University of Pisa - Università di Pisa Clique covering of large real-world networksHAL CCSD2016Edge Clique CoverReal-World NetworksLarge Networks[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Sagot, Marie-France2017-06-16 15:31:382023-03-15 08:53:382017-06-16 16:58:31enConference papershttps://hal.inria.fr/hal-01388477/document10.1145/2851613.2851816application/pdf1The 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.