References

Blochliger, I., and N. Zufferey, 2008. A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oper. Res., 35: 960-975.
CrossRef  |  

Ge, F., Z. Wei, Y. Tian and Z. Huang, 2010. Chaotic ant swarm for graph coloring. Proceedings of the 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems, October 29-31, 2010, IEEE, Xiamen, China, pp: 512-516.

Guan, X., Y. Wang and L. Tao, 2009. Machining scheme selection of digital manufacturing based on genetic algorithm and AHP. J. Intell. Manuf., 20: 661-669.
CrossRef  |  Direct Link  |  

Langdon, W., 1986. The Whale and the Reactor: A Search for Limits in an Age of High Technology. University of Chicago Press, Chicago, Illinois, USA., ISBN: 9780226902104, Pages: 200.

Lu, Z. and J.K. Hao, 2010. A memetic algorithm for graph coloring. Eur. J. Oper. Res., 203: 241-250.
CrossRef  |  Direct Link  |  

Rajabioun, R., 2011. Cuckoo optimization algorithm. Applied Soft Comput., 11: 5508-5518.
CrossRef  |  Direct Link  |  

Ray, B., A.J. Pal, D. Bhattacharyya and T.H. Kim, 2010. An efficient ga with multipoint guided mutation for graph coloring problems. Int. J. Signal Process. Image Process. Pattern Recognit., 3: 51-58.
Direct Link  |  

Webster, F., 2002. The Information Society Revisited. In: The Handbook of New Media, Lievrouwand, L.A. and S. Livingstone (Eds.). SAGE, London, England, UK., ISBN: 9780761965107, pp: 255-266.

Webster, F., 2002. Theories of the Information Society. 2nd Edn., Routledge, New York, USA., ISBN-13: 9780415282000, Pages: 273.