Lower bounds and upper bounds for chromatic polynomials.
Klaus DohmenPublished in: J. Graph Theory (1993)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- branch and bound
- worst case
- branch and bound algorithm
- lower and upper bounds
- objective function
- color images
- tight bounds
- np hard
- vc dimension
- optimal solution
- human perception
- generalization error
- linear programming relaxation
- sample complexity
- upper bounding
- cutting plane
- sample size
- concept classes
- lower bounding
- active learning
- randomly generated problems