%0 Journal Article
%T An Algorithm Find Maximal Complete-subgraph by Max-code<br>基于最大Code码的极大完全子图算法
%A GUO Ping
%A KANG Yan-Rong
%A SHI Xiao-Chen
%A <br>郭平
%A 康艳荣
%A 史晓晨
%J 计算机科学
%D 2006
%I 
%X In this paper,we propose a new algorithm,called FMCSG,to find the Maximal Complete-Subgraph in graph by Max-code. The graph is represented as adjacency matrix in FMCSG. By this way, it can prune the corresponding matrix of non-Max-code for the purpose of reducing the search space and improving the efficiency of the algorithm.
%K Maxical complete-subgraph
%K Maxcode
%K Represent graph<br>极大完全子图
%K 极大code码
%K 图表示
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=363952ACE2AF599E&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=0B39A22176CE99FB&sid=847B14427F4BF76A&eid=6235172E4DDBA109&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=9