Local Search for Diversified Top-k s-plex Search Problem (Student Abstract)

被引：0

作者：

Wu, Jun ^{[1
]}

Yin, Minghao ^{[1
]}

机构：

[1] Northeast Normal Univ, Sch Informat Sci & Technol, Changchun 130117, Peoples R China

来源：

THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE | 2021年 / 35卷

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The diversified top-k s-plex (DTKSP) search problem aims to find k maximal s-plexes that cover the maximum number of vertices with lower overlapping in a given graph. In this paper, we first formalize the diversified top-k s-plex search problem and prove the NP-hardness of it. Second, we proposed a local search algorithm for solving the diversified top k s-plex search problem based on some novel ideas. Experiments on real-world massive graphs show the effectiveness of our algorithm.

引用

页码：15929 / 15930

页数：2