ABSTRACT
ABSTRACT: Graphs play a major role in modeling many real-world problems. Due to the availability of huge data, the graph processing in serial environment become more complex. Thus, fast and efficient algorithms which work effectively utilizing the modern technologies are required. A maximal clique problem is one of the graph processing methods which is used in many applications. The Bron-Kerbosch (BK) algorithm is the most widely used and accepted algorithm for listing each and every maximal clique in a graph. Here an idea of a parallel version of BK algorithm is proposed which will reduce the computation time to a large extent than its serial implementation. It utilizes the cluster computing strategy.
