List Of First Fit Algorithm Graph Coloring

List Of First Fit Algorithm Graph Coloring. The above algorithm doesn’t always use minimum number of colors. For example, consider the following two graphs.

PPT Greedy Algorithms Neil Tang 4/8/2010 PowerPoint PresentationSource: www.slideserve.com

If we consider the vertices. Note that in graph on right side, vertices 3 and 4 are swapped. For example, consider the following two graphs.

For example, consider the following two graphs. Let’s think of graph coloring as a game with two. Web for many graphs, the first fit algorithm does not find an optimal coloring.

The above algorithm doesn’t always use minimum number of colors. Also, the number of colors used sometime depend on the order in which vertices are processed.

More articles

Category

Close Ads Here
Close Ads Here