Lower bounds for the happy coloring problems.

Ivan Bliznets Danil Sagunov

Published in: Theor. Comput. Sci. (2020)

Keyphrases

lower bound
problems involving
benchmark problems
upper bound
np complete
data sets
neural network
objective function
scheduling problem
branch and bound