Advertisement

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 

References

  1. 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
  2. 2.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm intelligence: from natural to artificial systems. Oxford University Press, New York (1999)MATHGoogle Scholar
  3. 3.
    Rodríguez, A., Reggia, J.A.: Extending self organizing particle systems to problem solving. Artif. Life 10(4), 379–395 (2004)CrossRefGoogle Scholar
  4. 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. 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
  6. 6.
    Birkhoff, G.D.: A determinant formula for the number of ways of coloring a map. Ann. Math. 14(1/4), 42–46 (1912)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Kempe, A.B.: On the geographical problem of the four colors. Am. J. Math. 2, 193–200 (1879)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)CrossRefGoogle Scholar
  9. 9.
    David, M.F., de Castro, L.N.: A New Clustering Boids Algorithm for Data Mining. Mackenzie University, Brazil (2008)Google Scholar
  10. 10.
    Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Comput. Oper. Res. 33, 2547–2562 (2006)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Leighton, F.T.: A graph colouring algorithm for large scheduling problems. J. Res. Natl Bur. Stan. 84(6), 489–503 (1979)CrossRefMATHMathSciNetGoogle Scholar
  12. 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
  13. 13.
    Lodding, K.N.: The Hitchhiker’s guide to biomorphic software. ACM Queue 2(4), 66–75 (2004). (Topic: Bioscience)CrossRefGoogle Scholar
  14. 14.
    Borodin, O.V., Glebov, A.N., Raspaud, A., Salavatipour, M.R.: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory Ser. B 93, 303–311 (2005)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer India 2014

Authors and Affiliations

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

Personalised recommendations