{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:11Z","timestamp":1759847771783},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,3,3]],"date-time":"2013-03-03T00:00:00Z","timestamp":1362268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10489-013-0429-5","type":"journal-article","created":{"date-parts":[[2013,3,2]],"date-time":"2013-03-02T12:08:52Z","timestamp":1362226132000},"page":"510-528","source":"Crossref","is-referenced-by-count":18,"title":["A hierarchical parallel genetic approach for the graph coloring problem"],"prefix":"10.1007","volume":"39","author":[{"given":"Reza","family":"Abbasian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malek","family":"Mouhoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,3]]},"reference":[{"issue":"1","key":"429_CR1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s10489-011-0317-9","volume":"37","author":"D Ayvaz","year":"2012","unstructured":"Ayvaz D, Topcuoglu HR, G\u00fcrgen FS (2012) Performance evaluation of evolutionary heuristics in dynamic environments. Appl Intell 37(1):130\u2013144","journal-title":"Appl Intell"},{"key":"429_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251\u2013256","journal-title":"Commun ACM"},{"issue":"3","key":"429_CR3","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1145\/177492.177575","volume":"16","author":"P Briggs","year":"1994","unstructured":"Briggs P, Cooper KD, Torczon L (1994) Improvements to graph coloring register allocation. ACM Trans Program Lang Syst 16(3):428\u2013455","journal-title":"ACM Trans Program Lang Syst"},{"key":"429_CR4","volume-title":"Efficient and accurate parallel genetic algorithms","author":"E Cantu-Paz","year":"2000","unstructured":"Cantu-Paz E (2000) Efficient and accurate parallel genetic algorithms. Kluwer Academic, Norwell"},{"issue":"6","key":"429_CR5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1002\/nav.1033","volume":"48","author":"M Caramia","year":"2001","unstructured":"Caramia M, Dell\u2019Olmo P (2001) Iterative coloring extension of a maximum clique. Nav Res Logist 48(6):518\u2013550","journal-title":"Nav Res Logist"},{"issue":"4","key":"429_CR6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/989393.989403","volume":"39","author":"G Chaitin","year":"2004","unstructured":"Chaitin G (2004) Register allocation and spilling via graph coloring. SIGPLAN Not 39(4):66\u201374","journal-title":"SIGPLAN Not"},{"key":"429_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02430368","volume":"1","author":"D Costa","year":"1995","unstructured":"Costa D, Hertz A, Dubuis O (1995) Embedding of a sequential algorithm within an evolutionary algorithm for coloring problems in graphs. J Heuristics 1:105\u2013128","journal-title":"J Heuristics"},{"key":"429_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/DAC.1997.597129","volume-title":"34th design automation conference","author":"O Coudert","year":"1997","unstructured":"Coudert O (1997) Exact coloring of real-life graphs is easy. In: 34th design automation conference, pp 121\u2013126"},{"issue":"1","key":"429_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-739X(93)90024-J","volume":"9","author":"J Cui","year":"1993","unstructured":"Cui J, Fogarty TC, Gammack JG (1993) Searching databases using parallel genetic algorithms on a transputer computing surface. Future Gener Comput Syst 9(1):33\u201340","journal-title":"Future Gener Comput Syst"},{"key":"429_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-45105-6_23","volume-title":"Proceedings of the 2003 international conference on genetic and evolutionary computation: Part\u00a0I (GECCO\u201903)","author":"V Cutello","year":"2003","unstructured":"Cutello V, Nicosia G, Pavone M (2003) A hybrid immune algorithm with information gain for the graph coloring problem. In: Proceedings of the 2003 international conference on genetic and evolutionary computation: Part\u00a0I (GECCO\u201903). Springer, Berlin, pp 171\u2013182"},{"key":"429_CR11","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/s10489-009-0189-4","volume":"32","author":"FJM Silva da","year":"2010","unstructured":"da Silva FJM, Perez JMS, Pulido JAG, Rodriguez MAV (2010) AlineaGA\u2014a genetic algorithm with local search optimization for multiple sequence alignment. Appl Intell 32:164\u2013172","journal-title":"Appl Intell"},{"key":"429_CR12","author":"I Fister","year":"2012","unstructured":"Fister I, Mernik M, Filipic\u0306 B (2012) Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm. Comput Optim Appl. doi: 10.1007\/s10589-012-9496-5","journal-title":"Comput Optim Appl"},{"issue":"4","key":"429_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao JK (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379\u2013397","journal-title":"J Comb Optim"},{"issue":"2","key":"429_CR14","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P Galinier","year":"2008","unstructured":"Galinier P, Hertz A, Zufferey N (2008) An adaptive memory algorithm for the k-coloring problem. Discrete Appl Math 156(2):267\u2013279","journal-title":"Discrete Appl Math"},{"key":"429_CR15","volume-title":"Computers and intractability; A\u00a0guide to the theory of NP-completeness","author":"MR Garey","year":"1990","unstructured":"Garey MR, Johnson DS (1990) Computers and intractability; A\u00a0guide to the theory of NP-completeness. Freeman, New York"},{"key":"429_CR16","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"issue":"3","key":"429_CR17","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s10489-011-0278-z","volume":"36","author":"MH Kang","year":"2012","unstructured":"Kang MH, Choi HR, Kim HS, Park BJ (2012) Development of a maritime transportation planning support system for car carriers based on genetic algorithm. Appl Intell 36(3):585\u2013604","journal-title":"Appl Intell"},{"key":"429_CR18","unstructured":"Kirovski D, Potknojak M (1997) Exact coloring of many real-life graphs is difficult, but heuristic coloring is almost always effective. Technical report"},{"key":"429_CR19","unstructured":"Klotz W (2002) Graph coloring algorithms. In: Mathematics Report, pp\u00a01\u20139. Technical University Clausthal"},{"key":"429_CR20","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F Leighton","year":"1997","unstructured":"Leighton F (1997) A graph coloring algorithm for large scheduling algorithms. J Res Natl Bur Stand 84:489\u2013506","journal-title":"J Res Natl Bur Stand"},{"issue":"6","key":"429_CR21","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton FT (1979) A graph coloring algorithm for large scheduling problems. J Res Natl Bur Stand 84(6):489\u2013506","journal-title":"J Res Natl Bur Stand"},{"key":"429_CR22","doi-asserted-by":"crossref","unstructured":"Li J, Burke EK, Qu R (2010) A pattern recognition based intelligent search method and two assignment problem case studies. Appl Intell. doi: 10.1007\/s10489-010-0270-z","DOI":"10.1007\/s10489-010-0270-z"},{"issue":"4","key":"429_CR23","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.future.2006.10.008","volume":"23","author":"D Lim","year":"2007","unstructured":"Lim D, Ong YS, Jin Y, Sendhoff B, Lee BS (2007) Efficient hierarchical parallel genetic algorithms using grid computing. Future Gener Comput Syst 23(4):658\u2013670","journal-title":"Future Gener Comput Syst"},{"issue":"7","key":"429_CR24","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1016\/j.future.2003.11.024","volume":"20","author":"Z Liu","year":"2004","unstructured":"Liu Z, Liu A, Wang C, Niu Z (2004) Evolving neural network using real coded genetic algorithm (ga) for multispectral image classification. Future Gener Comput Syst 20(7):1119\u20131129","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"429_CR25","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1016\/j.ejor.2008.03.050","volume":"197","author":"BB Mabrouk","year":"2009","unstructured":"Mabrouk BB, Hasni H, Mahjoub Z (2009) On a parallel genetic-tabu search based algorithm for solving the graph colouring proble. Eur J Oper Res 197(3):1192\u20131201","journal-title":"Eur J Oper Res"},{"issue":"1","key":"429_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E Malaguti","year":"2010","unstructured":"Malaguti E, Toth P (2010) A survey on vertex coloring problems. Int Trans Oper Res 17(1):1\u201334","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"429_CR27","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10489-009-0196-5","volume":"34","author":"N Mansour","year":"2011","unstructured":"Mansour N, Isahakian V, Ghalayini I (2011) Scatter search technique for exam timetabling. Appl Intell 34(2):299\u2013310","journal-title":"Appl Intell"},{"key":"429_CR28","unstructured":"Marx D (2004) Graph coloring with local and global constraints. PhD thesis, Budapest University of Technology and Economics"},{"key":"429_CR29","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1995","unstructured":"Mehrotra A, Trick MA (1995) A column generation approach for graph coloring. INFORMS J Comput 8:344\u2013354","journal-title":"INFORMS J Comput"},{"issue":"3","key":"429_CR30","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1026563910104","volume":"13","author":"I Miguel","year":"2000","unstructured":"Miguel I, Shen Q (2000) Dynamic flexible constraint satisfaction. Appl Intell 13(3):231\u2013245","journal-title":"Appl Intell"},{"issue":"1","key":"429_CR31","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s10489-010-0246-z","volume":"36","author":"M Mouhoub","year":"2012","unstructured":"Mouhoub M, Sukpan A (2012) Conditional and composite temporal CSPs. Appl Intell 36(1):90\u2013107","journal-title":"Appl Intell"},{"key":"429_CR32","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/WONS.2005.19","volume-title":"Proceedings of the second annual conference on wireless on-demand network systems and services","author":"J Riihijarvi","year":"2005","unstructured":"Riihijarvi J, Petrova M, Mahonen P (2005) Frequency allocation for wlans using graph colouring techniques. In: Proceedings of the second annual conference on wireless on-demand network systems and services. IEEE Comput Soc, Los Alamitos, pp 216\u2013222"},{"key":"429_CR33","doi-asserted-by":"crossref","unstructured":"Sabar NR, Ayob M, Qu R, Kendall G (2011)A graph coloring constructive hyper-heuristic for examination timetabling problems. Appl Intell. doi: 10.1007\/s10489-011-0309-9","DOI":"10.1007\/s10489-011-0309-9"},{"issue":"4","key":"429_CR34","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/S0167-739X(99)00134-X","volume":"17","author":"GA Sena","year":"2001","unstructured":"Sena GA, Megherbi D, Isern G (2001) Implementation of a parallel genetic algorithm on a cluster of workstations: traveling salesman problem, a case study. Future Gener Comput Syst 17(4):477\u2013488","journal-title":"Future Gener Comput Syst"},{"key":"429_CR35","author":"K Shi","year":"2012","unstructured":"Shi K, Li L (2012) High performance genetic algorithm based text clustering using parts of speech and outlier elimination. Appl Intell. doi: 10.1007\/s10489-012-0382-8","journal-title":"Appl Intell"},{"issue":"4","key":"429_CR36","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.1103\/PhysRevE.59.3983","volume":"59","author":"P Svenson","year":"1999","unstructured":"Svenson P, Nordahl MG (1999) Relaxation in graph coloring and satisfiability problems. Phys Rev E 59(4):3983\u20133999","journal-title":"Phys Rev E"},{"key":"429_CR37","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D Welsh","year":"1967","unstructured":"Welsh D, Powell M (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10:85","journal-title":"Comput J"},{"key":"429_CR38","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10489-011-0298-8","volume":"36","author":"H Xing","year":"2012","unstructured":"Xing H, Qu R (2012) A compact genetic algorithm for the network coding based resource minimization problem. Appl Intell 36:809\u2013823","journal-title":"Appl Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0429-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0429-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0429-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T10:49:56Z","timestamp":1562755796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0429-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,3]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["429"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0429-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,3]]}}}