Yet another algorithm for maximal clique enumeration problem

The maximal clique enumeration problem (MCE) is the task of identifying all subgraphs that form a clique. A clique is a subgraph in which all pairs of vertices are mutually adjacent. The maximality property refers to the noninclusion of each clique in another. The MCE problem is known to be NP-complete. Most MCE algorithms in the literature are recursive and recursive algorithms are difficult to parallelize because they rely on repeated function calls and previous results. This makes it difficult to evenly distribute the workload among parallel threads. Managing resource allocation and synchronization introduces overhead that can negate the benefits of parallelization. Although some recursive algorithms can be parallelized using techniques like task parallelism or memorization, the inherent structure of recursion often hinders efficient parallel execution. In this paper, we tackle the literature gap by presenting an iterative algorithm for the MCE problem.