Open AccessParallel and Serial Graph Coloring Implementations with Tabu Search Method
Author(s) -
Rutanshu Jhaveri,
N. Narayanan Prasanth,
K.Jaya kumar,
K. Navaz
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b1840.078219
Subject(s) - graph coloring , tabu search , computer science , fractional coloring , greedy coloring , list coloring , graph , combinatorics , parallel computing , theoretical computer science , graph power , mathematics , algorithm , line graph
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.