An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery

Xiaojia Xu, Haoyu Liu, Xiaowei Lv +2

Detecting locally, non-overlapping, near-clique densest subgraphs is a crucial problem for community search in social networks. As a vertex may be involved in multiple overlapped l…