论文信息 - An Approach to Determination of Maximal Cliques in Undirected Graphs

An Approach to Determination of Maximal Cliques in Undirected Graphs

The article proposes the implicit exhaustive search procedure based on the triangle decomposition of graphs for determining the maximal clique in the arbitrary undirected graph G in polynomial time; it has allowed developing an exact algorithm for solving the problem with time complexity not exceeding ) ( 7 n O , where n is the number of vertices in the graph G.

S. V. Listrovoy | E. S. Listrovaya | A. V. Sidorenko | S. Listrovoy | A. V. Sidorenko

[1] Peter Willett,et al. Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

[2] Fergal Reid,et al. Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[3] T. Vicsek,et al. Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[4] Listrovoy Sergey Vladimirovich. On Correlation of Р And NP Classes , 2012 .