Login / Signup
Towards Optimal Lower Bounds For Clique and Chromatic Number
Lars Engebretsen
Jonas Holmerin
Published in:
Electron. Colloquium Comput. Complex. (2001)
Keyphrases
</>
lower bound
optimal solution
np hard
neural network
computational complexity
upper bound
genetic algorithm
decision trees
evolutionary algorithm
dynamic programming
branch and bound algorithm
minimum cost
maximum number