| 5 | Solving diversified top-k weight clique search problem显示文摘Dear editor,Diversified top-k weight clique search(DTKWCS)is a problem that computes k cliques to maximize the sum of weights of all vertices contained in the cliques;that is,∑v_(∈{c1∪c2∪…∪ck})w(v)is maximized by giving a weighted graph G and an integer k,where ci is one of the k cliques,and w(v)is the weight of the vertex v in G.This problem is NP-hard. | Junping ZHOU Chumin LI Yupeng ZHOU Mingyang LI Lili LIANG Jianan WANG | 2021 | Science China(Information Sciences)2021，64，5： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员