{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:03:25Z","timestamp":1786979005701,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319775524","type":"print"},{"value":"9783319775531","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77553-1_3","type":"book-chapter","created":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T23:56:16Z","timestamp":1519862176000},"page":"35-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Evolving Graphs by Graph Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5036-3358","authenticated-orcid":false,"given":"Timothy","family":"Atkinson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1148-822X","authenticated-orcid":false,"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3146-5401","authenticated-orcid":false,"given":"Susan","family":"Stepney","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,3,2]]},"reference":[{"key":"3_CR1","unstructured":"Atkinson, T., Plump, D., Stepney, S.: Probabilistic graph programming. In: Proceedings of the International Workshop on Graph Computation Models (GCM 2017) (2017)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-40530-8_7","volume-title":"Graph Transformation","author":"C Bak","year":"2016","unstructured":"Bak, C., Plump, D.: Compiling graph programs to C. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 102\u2013117. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40530-8_7"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Coecke, B., Duncan, R.: Interacting quantum observables: categorical algebra and diagrammatics. New J. Phys. 13(4) (2011). 86 p","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"3_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"3_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32278-5","volume-title":"Graphs, Networks and Algorithms","author":"D Jungnickel","year":"2013","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms, 4th edn. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-32278-5","edition":"4"},{"key":"3_CR6","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1993","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1993)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-48885-5_8","volume-title":"Genetic Programming","author":"JR Koza","year":"1999","unstructured":"Koza, J.R., Bennett, F.H., Stiffelman, O.: Genetic programming as a Darwinian invention machine. In: Poli, R., Nordin, P., Langdon, W.B., Fogarty, T.C. (eds.) EuroGP 1999. LNCS, vol. 1598, pp. 93\u2013108. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48885-5_8"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-71605-1_32","volume-title":"Genetic Programming","author":"E Galv\u00e1n-L\u00f3pez","year":"2007","unstructured":"Galv\u00e1n-L\u00f3pez, E., Rodr\u00edguez-V\u00e1zquez, K.: Multiple interactive outputs in a single tree: an empirical investigation. In: Ebner, M., O\u2019Neill, M., Ek\u00e1rt, A., Vanneschi, L., Esparcia-Alc\u00e1zar, A.I. (eds.) EuroGP 2007. LNCS, vol. 4445, pp. 341\u2013350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71605-1_32"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-20883-1_1","volume-title":"Handbook of Genetic Programming Applications","author":"P Machado","year":"2015","unstructured":"Machado, P., Correia, J., Assun\u00e7\u00e3o, F.: Graph-based evolutionary art. In: Gandomi, A.H., Alavi, A.H., Ryan, C. (eds.) Handbook of Genetic Programming Applications, pp. 3\u201336. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20883-1_1"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Statist. 18(1), 50\u201360 (1947)","journal-title":"Ann. Math. Statist."},{"key":"3_CR11","volume-title":"Digital Design","author":"MM Mano","year":"2002","unstructured":"Mano, M.M.: Digital Design. EBSCO Publishing Inc., Ipswich (2002)"},{"key":"3_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17310-3","volume-title":"Cartesian Genetic Programming","author":"JF Miller","year":"2011","unstructured":"Miller, J.F.: Cartesian Genetic Programming. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2006.871253","volume":"10","author":"JF Miller","year":"2006","unstructured":"Miller, J.F., Smith, S.L.: Redundancy and computational efficiency in Cartesian Genetic Programming. IEEE Trans. Evol. Comput. 10(2), 167\u2013174 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"JF Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121\u2013132. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46239-2_9"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR16","unstructured":"Pereira, F.B., Machado, P., Costa, E., Cardoso, A.: Graph based crossover - a case study with the busy beaver problem. In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 1149\u20131155. Morgan Kaufmann (1999)"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Plump, D.: The design of GP 2. In: Proceedings of the Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), EPTCS, vol. 82, pp. 1\u201316 (2012). https:\/\/doi.org\/10.4204\/EPTCS.82.1","DOI":"10.4204\/EPTCS.82.1"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jlamp.2016.12.001","volume":"88","author":"D Plump","year":"2017","unstructured":"Plump, D.: From imperative to rule-based graph programs. J. Logical Algebraic Methods Program. 88, 154\u2013173 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.12.001","journal-title":"J. Logical Algebraic Methods Program."},{"key":"3_CR19","unstructured":"Poli, R.: Evolution of graph-like programs with parallel distributed genetic programming. In: B\u00e4ck, T. (ed.) Proceedings of the International Conference on Genetic Algorithms, pp. 346\u2013353. Morgan Kaufmann (1997)"},{"key":"3_CR20","unstructured":"Poli, R.: Parallel distributed genetic programming. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 403\u2013431. McGraw-Hill (1999)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BFb0055930","volume-title":"Genetic Programming","author":"C Ryan","year":"1998","unstructured":"Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83\u201396. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055930"},{"key":"3_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The Algorithm Design Manual","author":"SS Skiena","year":"2008","unstructured":"Skiena, S.S.: The Algorithm Design Manual, 2nd edn. Springer, London (2008). https:\/\/doi.org\/10.1007\/978-1-84800-070-4","edition":"2"},{"key":"3_CR23","unstructured":"Stanley, K.O., Miikkulainen, R.: Efficient reinforcement learning through evolving neural network topologies. In: Proceedings of the Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 569\u2013577. Morgan Kaufmann Publishers Inc. (2002)"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1162\/106365602320169811","volume":"10","author":"KO Stanley","year":"2002","unstructured":"Stanley, K.O., Miikkulainen, R.: Evolving neural networks through augmenting topologies. Evol. Comput. 10(2), 99\u2013127 (2002)","journal-title":"Evol. Comput."},{"key":"3_CR25","volume-title":"Horizontal Gene Transfer","author":"M Syvanen","year":"2001","unstructured":"Syvanen, M., Kado, C.I.: Horizontal Gene Transfer. Academic Press, London (2001)"},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10710-014-9233-1","volume":"16","author":"AJ Turner","year":"2015","unstructured":"Turner, A.J., Miller, J.F.: Introducing a cross platform open source Cartesian Genetic Programming library. Genet. Program Evolvable Mach. 16(1), 83\u201391 (2015)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"2","key":"3_CR27","first-page":"101","volume":"25","author":"A Vargha","year":"2000","unstructured":"Vargha, A., Delaney, H.D.: A critique and improvement of the CL common language effect size statistics of McGraw and Wong. J. Educ. Behav. Stat. 25(2), 101\u2013132 (2000)","journal-title":"J. Educ. Behav. Stat."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-24650-3_17","volume-title":"Genetic Programming","author":"JA Walker","year":"2004","unstructured":"Walker, J.A., Miller, J.F.: Evolution and acquisition of modules in Cartesian Genetic Programming. In: Keijzer, M., O\u2019Reilly, U.-M., Lucas, S., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 187\u2013197. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24650-3_17"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77553-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:26:46Z","timestamp":1710228406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77553-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319775524","9783319775531"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77553-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Parma","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2018\/cfp_eurogp.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}