List colouring of graphs using a genetic algorithm

Aditi Khandelwal, Pallavi Jain, Gur Saran

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The List Colouring Problem (LCP) is an NP-Hard optimization problem in which the goal is to find a proper list colouring of a graph G=(V, E) such that the number of colours used is minimized. This paper deals with the development and implementation of a Genetic Algorithm for the list colouring of graphs. Initial solutions are generated using two heuristics in equal proportion. Experiments have been carried out on randomly generated planar graphs with a list of colours for each vertex. Results for 32 graphs with size varying from 10 to 750 show that the proposed Genetic Algorithm implementation tends towards lower values of the number of colours used.

Original languageEnglish
Title of host publicationSmart Computing and Informatics - Proceedings of the 1st International Conference on SCI 2016
EditorsVikrant Bhateja, Swagatam Das, Suresh Chandra Satapathy
PublisherSpringer Science and Business Media Deutschland GmbH
Pages573-581
Number of pages9
ISBN (Print)9789811055430
DOIs
StatePublished - 1 Jan 2018
Externally publishedYes
Event1st International Conference on Smart Computing and Informatics, SCI 2016 - Visakhapatnam, India
Duration: 3 Mar 20174 Mar 2017

Publication series

NameSmart Innovation, Systems and Technologies
Volume77
ISSN (Print)2190-3018
ISSN (Electronic)2190-3026

Conference

Conference1st International Conference on Smart Computing and Informatics, SCI 2016
Country/TerritoryIndia
CityVisakhapatnam
Period3/03/174/03/17

Keywords

  • Genetic algorithm
  • List colouring

ASJC Scopus subject areas

  • Decision Sciences (all)
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'List colouring of graphs using a genetic algorithm'. Together they form a unique fingerprint.

Cite this