Benchmark problems for exhaustive exact maximum clique search algorithms

Abstract

There are well established widely used benchmark tests to assess the performance of practical exact clique search algorithms. In this paper a family of further benchmark problems is proposed mainly to test exhaustive clique search procedures.