Parallel and Serial Graph Coloring Implementations with Tabu Search Method | Zendy

Rutanshu Jhaveri | Zendy; N. Narayanan Prasanth | Zendy; K.Jaya kumar | Zendy; K. Navaz | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel 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 (ijrte)

Language(s) - English

Resource type - Journals

ISSN - 2277-3878

DOI - 10.35940/ijrte.b1840.078219

Subject(s) - tabu search , graph coloring , computer science , fractional coloring , graph , greedy coloring , list coloring , implementation , theoretical computer science , parallel computing , combinatorics , mathematics , graph power , algorithm , line graph , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research