An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.
Etsuji TomitaTomokazu SekiPublished in: DMTCS (2003)
Keyphrases
- maximum clique
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- combinatorial optimization
- np hard
- precedence constraints
- single machine scheduling problem
- variable ordering
- association graph
- special case
- search algorithm
- cost function
- natural language processing
- worst case
- metaheuristic
- computational complexity
- linear programming relaxation
- machine learning