A Parallel Algorithm for the Determination of All Cliques of a Symmetric Graph

This paper presents a very simple and efficient method for the determination of all cliques of symmetric graphs based on a divide-and-conquer strategy. The given graph is continually broken up into smaller and smaller subgraphs in such a way that the cliques can be obtained directly from these subgraphs. This method also leads itself naturally to parallel processing.