Abstract: The field of Mathematics has managed to achieve unprecedented success across many fields. One of the most useful topics is clique, it has many potential applications especially in bioinformatics. Clique applications are becoming useful more and more nowadays. Many algorithms for finding cliques have been studied and being applied. In this article, we attempt to address the facts and wonders of reducing the procedure of finding cliques. We describe how to reduce the way of multiplying the rows and columns of matrices which is mostly boring to calculate.
Keywords: Clique, graph theory, directed graph, undirected graph, vertex, series, maximal subset, symmetric matrix.
Title: THE HARD AND EASY WAY TO DETERMINE CLIQUE (A comparative Review)
Author: Azizullah Paeyndah and Adela Murid
International Journal of Mathematics and Physical Sciences Research
ISSN 2348-5736 (Online)
Research Publish Journals
