A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations.
Etsuji TomitaKen'ichi ImamatsuYasuhiro KohataMitsuo WakatsukiPublished in: Systems and Computers in Japan (1997)
Keyphrases
- maximum clique
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- association graph
- np hard
- combinatorial optimization
- upper bounding
- precedence constraints
- maximal cliques
- graph theory
- single machine scheduling problem
- neural network
- computational biology
- search algorithm
- complex networks
- genetic algorithm