Abstract
One of the well-known property of graph is graph coloring. Any two vertices of a graph are different colors such that they are adjacent to each other. The objective of this paper is to analyse the behavioral performance of Tabu Search method through serial and parallel implementations. We explore both parallel and serial Tabu search algorithm for graph coloring with arbitrary number of nodes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Recent Technology and Engineering (IJRTE)
Paper Title
Journal
Date
