Algorithmic methods of finite discrete structures. Graph clique problem

Sergey Kurapov, Maxim Davidovsky

The monography presents a new algorithm for finding the clique of maximal length in a nonseparable graph. The algorithm is based on the properties of the representation of a clique…