{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:45:36Z","timestamp":1743155136091,"version":"3.40.3"},"publisher-location":"New Delhi","reference-count":14,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132217671"},{"type":"electronic","value":"9788132217688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1768-8_10","type":"book-chapter","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:11:09Z","timestamp":1393891869000},"page":"113-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Coloring Problem Solution Using Modified Flocking Algorithm"],"prefix":"10.1007","author":[{"given":"Subarna","family":"Sinha","sequence":"first","affiliation":[]},{"given":"Suman","family":"Deb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"David Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. In: Proceedings of the I.R.E., pp. 1098\u20131110, Sept 1952","journal-title":"Proceedings of the IRE"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: from natural to artificial systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm intelligence: from natural to artificial systems. Oxford University Press, New York (1999)"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1162\/1064546041766424","volume":"10","author":"A Rodr\u2032\u0131guez","year":"2004","unstructured":"Rodr\u00edguez, A., Reggia, J.A.: Extending self organizing particle systems to problem solving. Artif. Life 10(4), 379\u2013395 (2004)","journal-title":"Artif. Life"},{"doi-asserted-by":"crossref","unstructured":"Reynolds, C.W.: Flocks, herds and schools: A distributed behavioral model. SIGGRAPH\u201987. In: Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, pp. 25\u201334. New York, NY, USA, ACM Press (1987)","key":"10_CR4","DOI":"10.1145\/37401.37406"},{"issue":"1\u20132","key":"10_CR5","first-page":"11","volume":"48","author":"M D\u00e1niel","year":"2004","unstructured":"D\u00e1niel, M.: Graph colouring problems and their applications in scheduling. Periodica Polytech., Electr. Eng. 48(1\u20132), 11\u201316 (2004). (CiteSeerX: 10.1.1.95.4268)","journal-title":"Periodica Polytech., Electr. Eng."},{"issue":"1\/4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"42","DOI":"10.2307\/1967597","volume":"14","author":"GD Birkhoff","year":"1912","unstructured":"Birkhoff, G.D.: A determinant formula for the number of ways of coloring a map. Ann. Math. 14(1\/4), 42\u201346 (1912)","journal-title":"Ann. Math."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2369235","volume":"2","author":"AB Kempe","year":"1879","unstructured":"Kempe, A.B.: On the geographical problem of the four colors. Am. J. Math. 2, 193\u2013200 (1879)","journal-title":"Am. J. Math."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"unstructured":"David, M.F., de Castro, L.N.: A New Clustering Boids Algorithm for Data Mining. Mackenzie University, Brazil (2008)","key":"10_CR9"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Comput. Oper. Res. 33, 2547\u20132562 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph colouring algorithm for large scheduling problems. J. Res. Natl Bur. Stan. 84(6), 489\u2013503 (1979)","journal-title":"J. Res. Natl Bur. Stan."},{"doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. In: Proceedings of SIGPLAN\u201982 Symposium on Compiler Construction, SIGPLAN Notices, vol. 17(6), June 1982","key":"10_CR12","DOI":"10.1145\/872726.806984"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1016978.1016985","volume":"2","author":"KN Lodding","year":"2004","unstructured":"Lodding, K.N.: The Hitchhiker\u2019s guide to biomorphic software. ACM Queue 2(4), 66\u201375 (2004). (Topic: Bioscience)","journal-title":"ACM Queue"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.jctb.2004.11.001","volume":"93","author":"OV Borodin","year":"2005","unstructured":"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\u2013311 (2005)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1768-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T23:14:13Z","timestamp":1676848453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1768-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132217671","9788132217688"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1768-8_10","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"4 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}