Algorithm in Polynomial Runtime for CLIQUE
Jan Luegering · viXra · 2019
This paper provides an unchecked algorithm in polynomial runtime for the CLIQUE problem. The input is the adjacency matrix of a graph, the output is an array of subarrays. Each subarray represents a clique, containing the node numbers.