Description |
Determining the chromatic number of a graph is known to be NP-hard. We will consider the problem of coloring a k-colorable graph on n vertices with n^{alpha} colors (where alpha < 1). We will give an algorithm for this problem using Semi Definite Programming (a generalization of LP ). |