EMIS 8374 Extra Credit Project: Graph Coloring Updated 22 April 2004
Example Graph g1.txt
Optimal Coloring of g1.txt: 4 colors 1(3) 2(4)8(3)3(2)5(1)7(2) 4(3) 10(1) 6(4)9(4)
Heuristic 1 Solution for g1.txt: 5 Colors (1) (2)(3) (1) (2) (4) (3)(1) (3) (5)
Heuristics for Graph Coloring 1.Color in numerical order 1, 2, …, |N|. 2.Max Degree First Sort nodes in descending order by degree (largest first) Color in the sorted order 3.Min Degree Last Sort nodes in ascending order by degree (lowest first) Color in the sorted order
Assignment: Complete This Table