Graph Coloring Using Eigenvalue Decomposition

Determining whether the vertices of a graph can be colored using k different colors so that no two adjacent vertices receive the same color is a well-known NP-complete problem. Graph coloring is also of practical interest (for example, in estimating sparse Jacobians and in scheduling), and many heur... View More