Login / Signup
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
Etsuji Tomita
Kohei Yoshida
Takuro Hatta
Atsuki Nagao
Hiro Ito
Mitsuo Wakatsuki
Published in:
FAW (2016)
Keyphrases
</>
maximum clique
branch and bound algorithm
lower bound
branch and bound
np hard
upper bound
precedence constraints
optimal solution
combinatorial optimization
association graph
variable ordering
single machine scheduling problem
computational biology
search algorithm
graph theory
maximal cliques