Abstract: 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

Key words: Maxical complete-subgraph,Maxcode, Represent graph