Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms.
Sándor SzabóBogdán ZaválnijPublished in: Informatica (Slovenia) (2019)
Keyphrases
- benchmark problems
- maximum clique
- search algorithm
- branch and bound algorithm
- simulated annealing
- branch and bound
- optimization problems
- association graph
- job shop scheduling problem
- computational biology
- tabu search
- maximal cliques
- genetic algorithm
- graph theory
- metaheuristic
- evolutionary algorithm
- relational databases
- np complete
- upper bound
- contact map
- search space