Graph Coloring Problem Solution Using Modified Flocking Algorithm

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 259)

Abstract

Graph coloring is a widely studied method of assigning labels or colors to elements of a graph. This can also be mapped with bio-inspired bird flocking algorithms to solve the NP complete graph coloring problem in optimum time complexity. This paper proposes an application of the Bird flocking algorithm that uses the concepts of a flock of agents, e.g. birds moving together in a complex manner with simple local rules namely cohesion, alignment, separation and avoidance. Each bird representing one data, move with the aim of creating homogeneous groups of data in a two dimensional environment producing a spatial distribution that can be used to solve a particular computational problem. The combination of these characteristics can be used to design and solve the task of 3 coloring graphs. This graph labeling can hierarchically or linearly be applied on a domain specific network or set of items.

Keywords

Graph coloring Swarm Bird flocking NP complete Spatial distribution 

Copyright information

© Springer India 2014

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringNational Institute of TechnologyAgartalaIndia

Personalised recommendations