1 paper
Xiaowei Ye, Miao Qiao, Rong-Hua Li +2
In this paper, we present a collection of novel and scalable algorithms designed to tackle the challenges inherent in the k-clique densest subgraph problem (\kcdsp) within networ…