Year of Graduation
The Maximum Clique Problem and its Applications
We have suggested new algorithm for the maximum clique problem which allowsto reduce computational time and the number of the search tree size significantly.Also, we have demonstrated that the idea used in our algorithm can be successfullyapplied to another algorithms for the maximum clique problem. The best performance in comparison with other algorithms our approach has on large instanceswhich are hard to solve.We use our algorithm to solve ”The Protein Structure Alignment Problem”.Our results are at least comparable with the performance of the ACF algorithmand better than MCS, MAX-SAT and BBMCXRS. Moreover, our algorithm is able(in contrast to BBMCXRS and MAX-SAT algorithms) to solve larges instanceswith not high density and large number of vertices.