Graph Coloring Problem Solution Using Modified Flocking Algorithm
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.
KeywordsGraph coloring Swarm Bird flocking NP complete Spatial distribution
- 1.Huffman, D.A.: A method for the construction of minimum-redundancy codes. In: Proceedings of the I.R.E., pp. 1098–1110, Sept 1952Google Scholar
- 4.Reynolds, C.W.: Flocks, herds and schools: A distributed behavioral model. SIGGRAPH’87. In: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, pp. 25–34. New York, NY, USA, ACM Press (1987)Google Scholar
- 5.Dániel, M.: Graph colouring problems and their applications in scheduling. Periodica Polytech., Electr. Eng. 48(1–2), 11–16 (2004). (CiteSeerX: 10.1.1.95.4268)Google Scholar
- 9.David, M.F., de Castro, L.N.: A New Clustering Boids Algorithm for Data Mining. Mackenzie University, Brazil (2008)Google Scholar
- 12.Chaitin, G.J.: Register allocation and spilling via graph coloring. In: Proceedings of SIGPLAN’82 Symposium on Compiler Construction, SIGPLAN Notices, vol. 17(6), June 1982Google Scholar