{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:05:10Z","timestamp":1742947510111,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319306971"},{"type":"electronic","value":"9783319306988"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30698-8_13","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T13:32:10Z","timestamp":1458307930000},"page":"186-201","source":"Crossref","is-referenced-by-count":3,"title":["Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs"],"prefix":"10.1007","author":[{"given":"Bradley","family":"Hardy","sequence":"first","affiliation":[]},{"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"KI Aardal","year":"2007","unstructured":"Aardal, K.I., Van Hoesel, S.P., Koster, A.M., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79\u2013129 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Comput. Oper. Res. 35(3), 960\u2013975 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/872726.806984","volume":"17","author":"GJ Chaitin","year":"1982","unstructured":"Chaitin, G.J.: Register allocation & spilling via graph coloring. ACM Sigplan Not. 17(6), 98\u2013101 (1982)","journal-title":"ACM Sigplan Not."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ejor.2008.01.028","volume":"195","author":"A Dupont","year":"2009","unstructured":"Dupont, A., Linhares, A.C., Artigues, C., Feillet, D., Michelon, P., Vasquez, M.: The dynamic frequency assignment problem. Eur. J. Oper. Res. 195(1), 75\u201388 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-44629-X_9","volume-title":"Practice and Theory of Automated Timetabling III","author":"W Erben","year":"2001","unstructured":"Erben, W.: A grouping genetic algorithm for graph colouring and exam timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 132\u2013156. Springer, Heidelberg (2001)"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first fit colorings of graphs. J. Graph Theor. 12(2), 217\u2013227 (1988)","journal-title":"J. Graph Theor."},{"issue":"7","key":"13_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0895-7177(97)00050-2","volume":"25","author":"F Harary","year":"1997","unstructured":"Harary, F., Gupta, G.: Dynamic graph models. Math. Comput. Model. 25(7), 79\u201387 (1997)","journal-title":"Math. Comput. Model."},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"issue":"6","key":"13_CR10","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 coloring algorithm for large scheduling problems. J. Res. Nat. Bur. Stand. 84(6), 489\u2013506 (1979)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"13_CR11","unstructured":"Lewis, R.: Constructing wedding seating plans: a tabu subject. In: Proceedings of the International Conference on Genetic and Evolutionary Methods (GEM). The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp), p. 1 (2013)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0167-5060(08)70584-3","volume":"43","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L., Saks, M., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Ann. Discrete Math. 43, 319\u2013325 (1989)","journal-title":"Ann. Discrete Math."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Monical, C., Stonedahl, F.: Static vs. dynamic populations in genetic algorithms for coloring a dynamic graph. In: Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, pp. 469\u2013476. ACM (2014)","DOI":"10.1145\/2576768.2598233"},{"key":"13_CR14","first-page":"381","volume":"6","author":"D Preuveneers","year":"2004","unstructured":"Preuveneers, D., Berbers, Y.: ACODYGRA: an agent algorithm for coloring dynamic graphs. Symbolic Numer. Algorithms Sci. Comput. 6, 381\u2013390 (2004)","journal-title":"Symbolic Numer. Algorithms Sci. Comput."},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2008.10.001","volume":"198","author":"R Qu","year":"2009","unstructured":"Qu, R., Burke, E.K., McCollum, B.: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. Eur. J. Oper. Res. 198(2), 392\u2013404 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Tantipathananandh, C., Berger-Wolf, T., Kempe, D.: A framework for community identification in dynamic social networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 717\u2013726. ACM (2007)","DOI":"10.1145\/1281192.1281269"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30698-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:35:50Z","timestamp":1559399750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30698-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319306971","9783319306988"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30698-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}