计算机工程与应用2018，Vol.54Issue(5)：66-71,6.DOI:10.3778/j.issn.1002-8331.1610-0044
S-Clique:属性约束的极大团枚举
S-Clique:Attribute constrained maximal clique enumeration
摘要
Abstract
Maximal clique enumeration is a fundamental problem in graph theory and widely applied to various fields such as social networks.However,in reality world,the graph not only is huge but also carries important attribute information on the vertex.The current algorithms focus on the structure,largely ignoring the attribute content on the vertex.This paper presents S-Clique combining both the characters of structure and attribute information.The length of the intersection of each vertex attribute value set meets the minimum support. For S-Clique problem, it proposes an efficient algorithm SCE-PE,which makes full use of the parent node equivalence pruning strategies.Meanwhile it re-optimizes vertex vis-its order to improve the performance of the algorithm.The experimental results show that algorithm of SCE-PE improves the efficiency by 40% compared with the basic algorithm.关键词
图数据/极大团/属性约束/支持度Key words
graph data/maximal clique/attribute constraints/support分类
信息技术与安全科学引用本文复制引用
周翠莲,游进国,张婷,简兴明..S-Clique:属性约束的极大团枚举[J].计算机工程与应用,2018,54(5):66-71,6.基金项目
国家自然科学基金(No.61462050,No.61562054) （No.61462050,No.61562054）
云南省自然科学基金(No.2013FZ020,No.KKSY201303095) （No.2013FZ020,No.KKSY201303095）
高等学校学科创新引智计划(111计划)(No.B12028). （111计划）
