Distributed algorithms for maximum cliques
David Hung-Chang Du, Andrew E. B. Lim, Ching-Ting Wu · Journal of Information and Optimization Sciences · 1996
Finding the maximum cliques in a graph has been an important research topic for decades. It has many applications in CAD for VLSI design, operations research, network layout, and etc. In this paper, we propose distributed algorithms to find all maximum cliques in a given graph. An O(n 3) heuristic is also proposed. Experimental results show that the quality of the solutions found by the heuristic to be very close to the optimal solutions.