【摘要】 本文先建立关于图的边分解和顶点分解的一些定理,然后论述求图的最大团的几种算法:顶点分解、边分解的混合分解.最后举例说明边分解的算法.用FORTRAN语言编写的该算法的程序已在IBM-PC机上实现.更多还原

【Abstract】 This paper proposes a few theorems of edge decomposition and vertex decomposition of a graph. Several algorithms to find graphic maximum clique by the procedure of vertex decomposition, edge decomposition and hybrid decomposition are described. An example to explain the algorithm of edge decomposition is given. A program based on the algorithm has been realized on IBM-PC in the Fortran language.更多还原