An Algorithm Find Maximal Complete-subgraph by Max-code
基于最大Code码的极大完全子图算法

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.