+30 First Fit Algorithm Graph Coloring. Note that in graph on right side, vertices 3 and 4 are swapped. The above algorithm doesn’t always use minimum number of colors.
Source: dotclu.blogspot.com
For example, consider the following two graphs. If we consider the vertices. Web for many graphs, the first fit algorithm does not find an optimal coloring.
Let’s think of graph coloring as a game with two. The above algorithm doesn’t always use minimum number of colors. For example, consider the following two graphs.
If we consider the vertices. Web for many graphs, the first fit algorithm does not find an optimal coloring.
