基于局部有限搜索的无向图近似最大团快速求解算法 (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy)

计算机科学 Pub Date : 2020-01-01 DOI:10.11896/jsjkx.181102109

M. Zhong, Chao Jiang, Lan Tao, Xiong He, Yuansheng Luo

引用次数: 0

基于局部有限搜索的无向图近似最大团快速求解算法 (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy)

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

计算机科学

自引率

0.00%

发文量

21143

期刊介绍： Computer Science (CS) was established in 1974, its original title was Computer Applications and Applied Mathematics until 1979. It is sponsored by Chongqing Southwest Information Co., Ltd, and is the member Journal of CCF（China Computer Federation) and the CCF B Class journal. Computer Science (CS) mainly reports the dynamic development, methodologies and techniques involving a wide range, and International advanced research productions of computer science and technology. Computer Science (CS) has been included in many important national and international index databases, such as CSCD,GCJC, CSA ,DOAJ, IC , UPD, JST. Readers of Computer Science (CS) include the students of college, researches and technicists engaged in the field of computer science and technology