Parallel and serial graph coloring implementations with tabu search method

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.