Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms
Informatica2019Vol. 43(2)
Citations Over Time
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.
Related Papers
- → Multi-Threading a State-of-the-Art Maximum Clique Algorithm(2013)43 cited
- → Some Improvements On Kumlander-S Maximum Weight Clique Extraction Algorithm(2012)9 cited
- → Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms(2019)5 cited
- → Comparison of MPI Implementations on a Shared Memory Machine(2000)7 cited
- A Method to Extend an Algorithm for the Maximum Clique Proplem to an Algorithm for the Maximum Weighted Clique Problem(2004)