k, cliques=None)中的参数k解释k-clique是G={V,E}的子集，k-clique中的每一个node与其他的node两...
Finding large diverse communities on networks: the edge maximum k*-partite cliquedoi:10.14778/3407790.3407846Alexander ZhouYue WangLei ChenVLDB EndowmentPUB4722Very Large Data Bases