Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem.
Alexey NikolaevMikhail BatsynPablo San SegundoPublished in: LION (2015)
Keyphrases
- search tree
- branch and bound algorithm
- branch and bound
- lower bound
- search algorithm
- search space
- upper bound
- np hard
- branching factor
- depth first search
- iterative deepening
- combinatorial optimization
- root node
- binary search trees
- optimal solution
- dead ends
- b tree
- max sat
- sat solvers
- simulated annealing
- database systems
- game tree
- database
- data analysis
- backtracking algorithm