A fast algorithm for the maximum clique problem - ScienceDirect

Given a graph, in the maximum clique problem, one desires to find the largest number of vertices, any two of which are adjacent. A branch-and-bound algorithm  ...

www.sciencedirect.com