A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
Etsuji TomitaYoichi SutaniTakanori HigashiShinya TakahashiMitsuo WakatsukiPublished in: WALCOM (2010)
Keyphrases
- maximum clique
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- association graph
- precedence constraints
- np hard
- optimal solution
- combinatorial optimization
- computational biology
- single machine scheduling problem
- maximal cliques
- variable ordering
- upper bounding
- neural network
- search algorithm
- graph theory
- semantic similarity