Parallel and Serial Graph Coloring Implementations with Tabu Search Method
Rutanshu Jhaveri1, Narayanan Prasanth2, Jayakumar K3, Navaz K4 

1Rutanshu Jhaveri, School of CSE, VIT University, Vellore, India.
2Narayanan Prasanth, School of CSE, VIT University, Vellore, India.
3K.Jayakumar, School of CSE, VIT University, Vellore, India.
4K.Navaz, Dept. of CSE, Annamacharya Institute of Technology and Sciences Tirupathi, India.

Manuscript received on 01 March 2019 | Revised Manuscript received on 05 March 2019 | Manuscript published on 30 July 2019 | PP: 1050-1056 | Volume-8 Issue-2, July 2019 | Retrieval Number: B1840078219/19©BEIESP | DOI: 10.35940/ijrte.B1840.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

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.
Index Terms: Algorithm Analysis, Graph Coloring, Parallel Processing, Tabu Search.

Scope of the Article:
Parallel Computing