{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:55:06Z","timestamp":1743101706781,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319929903"},{"type":"electronic","value":"9783319929910"}],"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-92991-0_5","type":"book-chapter","created":{"date-parts":[[2018,5,28]],"date-time":"2018-05-28T15:38:38Z","timestamp":1527521918000},"page":"63-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic Graph Programs for Randomised and Evolutionary Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5036-3358","authenticated-orcid":false,"given":"Timothy","family":"Atkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1148-822X","authenticated-orcid":false,"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3146-5401","authenticated-orcid":false,"given":"Susan","family":"Stepney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"5_CR1","unstructured":"Atkinson, T., Plump, D., Stepney, S.: Probabilistic graph programming. In: Pre-Proceedings of Graph Computation Models (GCM 2017) (2017)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-77553-1_3","volume-title":"Genetic Programming","author":"T Atkinson","year":"2018","unstructured":"Atkinson, T., Plump, D., Stepney, S.: Evolving graphs by graph programming. In: Castelli, M., Sekanina, L., Zhang, M., Cagnoni, S., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2018. LNCS, vol. 10781, pp. 35\u201351. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77553-1_3"},{"key":"5_CR3","unstructured":"Bak, C.: GP 2: efficient implementation of a graph programming language. Ph.D. thesis, Department of Computer Science, University of York (2015). http:\/\/etheses.whiterose.ac.uk\/12586\/"},{"key":"5_CR4","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":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-87405-8_27","volume-title":"Graph Transformations","author":"G Bergmann","year":"2008","unstructured":"Bergmann, G., Horv\u00e1th, \u00c1., R\u00e1th, I., Varr\u00f3, D.: A benchmark evaluation of incremental pattern matching in graph transformation. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 396\u2013410. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87405-8_27"},{"key":"5_CR6","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"A.E. Eiben","year":"2015","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series, Second edn. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-05094-1"},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publ. Math. (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publ. Math. (Debrecen)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.4204\/EPTCS.159.3","volume":"159","author":"Maribel Fern\u00e1ndez","year":"2014","unstructured":"Fern\u00e1ndez, M., Kirchner, H., Pinaud, B.: Strategic port graph rewriting: an interactive modelling and analysis framework. In: Proceedings of 3rd Workshop on Graph Inspection and Traversal Engineering (GRAPHITE 2014). Electronic Proceedings in Theoretical Computer Science, vol. 159, pp. 15\u201329 (2014). https:\/\/doi.org\/10.4204\/EPTCS.159.3","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"1","key":"5_CR10","first-page":"63","volume":"74","author":"R Heckel","year":"2006","unstructured":"Heckel, R., Lajios, G., Menge, S.: Stochastic graph transformation systems. Fundamenta Informaticae 74(1), 63\u201384 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-74730-9_8","volume-title":"Software Technologies: Applications and Foundations","author":"I Hristakiev","year":"2018","unstructured":"Hristakiev, I., Plump, D.: Checking graph programs for confluence. In: Seidl, M., Zschaler, S. (eds.) STAF 2017. LNCS, vol. 10748, pp. 92\u2013108. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74730-9_8"},{"key":"5_CR12","unstructured":"Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: Proceedings of 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1993), pp. 21\u201330. Society for Industrial and Applied Mathematics (1993)"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Karger, D.R.: Random sampling in matroids, with applications to graph connectivity and minimum spanning trees. In: Proceedings of 34th Annual Symposium on Foundations of Computer Science (FOCS 1993), pp. 84\u201393 (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366879","DOI":"10.1109\/SFCS.1993.366879"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-33654-6_21","volume-title":"Graph Transformations","author":"C Krause","year":"2012","unstructured":"Krause, C., Giese, H.: Probabilistic graph transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 311\u2013325. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_21"},{"key":"5_CR15","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-540-71605-1_32"},{"issue":"1","key":"5_CR16","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. Stat. 18(1), 50\u201360 (1947)","journal-title":"Ann. Math. Stat."},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Miller, J.F. (ed.): Cartesian Genetic Programming. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17310-3_2","DOI":"10.1007\/978-3-642-17310-3_2"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.4204\/EPTCS.225.6","volume":"225","author":"Detlef Plump","year":"2016","unstructured":"Plump, D.: Reasoning about graph programs. In: Proceedings of Computing with Terms and Graphs (TERMGRAPH 2016). Electronic Proceedings in Theoretical Computer Science, vol. 225, pp. 35\u201344 (2016). https:\/\/doi.org\/10.4204\/EPTCS.225.6","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"5_CR20","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":"5_CR21","unstructured":"Poli, R.: Parallel distributed genetic programming. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 403\u2013431. McGraw-Hill, New York (1999)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-09108-2_3","volume-title":"Graph Transformation","author":"CM Poskitt","year":"2014","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 33\u201348. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09108-2_3"},{"key":"5_CR23","unstructured":"Stanley, K.O., Miikkulainen, R.: Efficient reinforcement learning through evolving neural network topologies. In: Proceedings of Annual Conference on Genetic and Evolutionary Computation (GECCO 2002), pp. 569\u2013577. Morgan Kaufmann, Burlington (2002)"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Turner, A.J., Miller, J.F.: Cartesian genetic programming encoded artificial neural networks: a comparison using three benchmarks. In: Proceedings of GECCO 2013, pp. 1005\u20131012. ACM (2013). https:\/\/doi.org\/10.1145\/2463372.2463484","DOI":"10.1145\/2463372.2463484"},{"issue":"1","key":"5_CR25","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. Evol. Mach. 16(1), 83\u201391 (2015). https:\/\/doi.org\/10.1007\/s10710-014-9233-1","journal-title":"Genet. Program. Evol. Mach."},{"issue":"2","key":"5_CR26","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."}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92991-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:58:33Z","timestamp":1710341913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92991-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319929903","9783319929910"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92991-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.hpi.uni-potsdam.de\/giese\/events\/icgt2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}