Probe Machine Based Computing Model for Maximum Clique Problem  

作　　者：CUI Jianzhong YIN Zhixiang TANG Zhen YANG Jing 

机构地区：[1]Department of Computer,Huainan Union University,Huainan 232038,China [2]School of Electronic and Information Engineering,Anhui University of Science&Technology,Shanghai 201620,China [3]School of Mathematics,Physics and Statistics,Shanghai University of Engineering Science,Huainan 232001,China [4]School of Mathematics and Big Data,Anhui University of Science&Technology,Huainan 232001,China

出　　处：《Chinese Journal of Electronics》2022年第2期304-312,共9页电子学报（英文版）

基　　金：supported by the National Natural Science Foundation ty(KJ2019A0538)of China(62072296,61702008);Natural Science Foundation of Anhui University(KJ2019A0538)。

摘　　要：Probe machine(PM)is a recently reported mathematic model with massive parallelism.Herein,we presented searching the maximum clique of an undirected graph with six vertices.We constructed data library containing n sublibraries,each sublibrary corresponded to a vertex in the given graph.Then,probe library according to the induced subgraph was designed in order to search and generate all maximal cliques.Subsequently,we performed probe operation,and all maximal cliques were generated in parallel.The advantages of the proposed model lie in two aspects.On one hand,solution to NP-complete problem is generated in just one step of probe operation rather than found in vast solution space.On the other hand,the proposed model is highly parallel.The work demonstrates that PM is superior to TM in terms of searching capacity when tackling NP-complete problem.

关 键 词：Probe machine NP-COMPLETE Maximum clique problem 

分 类 号：O157.5[理学—数学]