Benchmark problems for exhaustive exact maximum clique search algorithms