Large-scale clique cover of real-world networks
Large-scale clique cover of real-world networks
复制标题
现实世界网络的大规模派系覆盖
DOI：
10.1016/j.ic.2019.104464
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Andrea Marino
中科院分区：
文献类型：
--
作者：
A. Conte;R. Grossi;Andrea Marino
The edge clique cover (ecc) problem deals with discovering a set of (possibly overlapping) cliques in a given graph that covers each of the graph's edges. This problem finds applications ranging from social networks to compiler optimization and stringology. We consider several variants of the ecc problem, using classical quality measures (like the number of cliques) and new ones. We describe efficient heuristic algorithms, the fastest one taking O (m d G) time for a graph with m edges, degeneracy d G (also known as k-core number). For large real-world networks with millions of nodes, like social networks, an algorithm should have (almost) linear running time to be practical: Our algorithm for finding ecc s of large networks has linear-time performance in practice because d G is small, as our experiments show, on real-world networks with thousands to several million nodes.
影响因子：
1.1
作者：
Tomita, Etsuji;Tanaka, Akira;Takahashi, Haruhisa
通讯作者：
Takahashi, Haruhisa