Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks

Wenqing Lin, Xin Chen, Haoxuan Xie +2

A $k$-clique is a dense graph, consisting of $k$ fully-connected nodes, that finds numerous applications, such as community detection and network analysis. In this paper, we study…