Solving diversified top-k weight clique search problem  

作　　者：Junping ZHOU Chumin LI Yupeng ZHOU Mingyang LI Lili LIANG Jianan WANG 

机构地区：[1]School of Information Science and Technology,Northeast Normal University,Changchun 130117,China [2]Modelisation,Information&Systemes,Universite de Picardie Jules Verne,Amiens 80000,France

出　　处：《Science China(Information Sciences)》2021年第5期43-44,共2页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.61976050,61403076,61806050,61806082);Fundamental Research Funds for the Central Universities(Grant No.2412019FZ050)。

摘　　要：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.

关 键 词：WEIGHT CLIQUE PROBLEM 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]