CliSAT: a new exact algorithm for hard maximum clique problems

Cites Work

Infra-chromatic bound for exact maximum clique search
A new exact maximum clique algorithm for large and massive sparse graphs
An adaptive multistart tabu search approach to solve the maximum clique problem
An exact bit-parallel algorithm for the maximum clique problem
An exact algorithm for the maximum clique problem
Clique is hard to approximate within \(n^{1-\epsilon}\)
A fast algorithm for the maximum clique problem
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
The maximum clique interdiction problem
A new upper bound for the maximum weight clique problem
An improved bit parallel exact maximum clique algorithm
A new branch-and-bound algorithm for the maximum weighted clique problem
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
A branch-and-cut algorithm for the edge interdiction clique problem
A new branch-and-filter exact algorithm for binary constraint satisfaction problems
Speeding up branch and bound algorithms for solving the maximum clique problem
Relaxed approximate coloring in exact maximum clique search
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
A review on algorithms for maximum clique problems
A survey on vertex coloring problems
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Finding a Maximum Clique in an Arbitrary Graph
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Incremental Upper Bound for the Maximum Clique Problem
Why Is Maximum Clique Often Easy in Practice?
A Computing Procedure for Quantification Theory
Benchmarking optimization software with performance profiles.
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item