Los puntos clave no están disponibles para este artículo en este momento.
An algorithm for enumerating maximal cliques (complete subgraphs) is proposed. The aim is to deal with the difficulties caused by the size of the problem.MSC codesAlgorithmscliqueenumerationgraph
E. A. Akkoyunlu (Thu,) studied this question.