A Comparative Study of BFO and Greedy Algorit...

A Comparative Study of BFO and Greedy Algorithm for Graph Colorization Problems from Node 10 to 150

Author Name : Dr. Kiran Malik

ABSTRACT Graph colorization is a classic problem in computer science that has been studied extensively in the past few decades. It involves assigning colors to the vertices of a graph such that adjacent vertices have different colors. This problem has numerous real-world applications such as scheduling, map coloring, and register allocation. In this paper, we compare the performance of two different algorithms - Bacteria Foraging Optimization (BFO) and Greedy Algorithm - for solving graph colorization problems with varying number of nodes from 10 to 150. We evaluate the accuracy and efficiency of both algorithms and analyze their performance on different types of graphs.