International Journal of All Research Education & Scientific Methods
An ISO Certified Peer-Reviewed Journal
ISSN: 2455-6211
International Journal of All Research Education & Scientific Methods
An ISO Certified Peer-Reviewed Journal
ISSN: 2455-6211
Posted Date : 03rd Jun, 2023
Publishing in UGC-approved journals offers several advantages, includi...
Posted Date : 03rd Jun, 2023
UGC-approved journals refer to the scholarly journals that have been a...
Posted Date : 09th Sep, 2022
The University of Pune is going to update the ugc care listed journals...
Posted Date : 09th Sep, 2022
IJARESM Publication have various tie ups with many Conference/Seminar ...
Posted Date : 07th Mar, 2022
Call For Papers : LokSanwad Foundation Aurangabad, Maharashtra One Day...
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.
