{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:08:28Z","timestamp":1743016108507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319589428"},{"type":"electronic","value":"9783319589435"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58943-5_45","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T08:42:07Z","timestamp":1495874527000},"page":"557-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Synthetic Graph Generation for Systematic Exploration of Graph Structural Properties"],"prefix":"10.1007","author":[{"given":"Merijn","family":"Verstraaten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana Lucia","family":"Varbanescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cees","family":"de Laat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"unstructured":"Avery, C.: Giraph: large-scale graph processing infrastructure on hadoop. In: Proceedings of the Hadoop Summit, Santa Clara (2011)","key":"45_CR1"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-36763-2_48","volume-title":"Graph Drawing","author":"B Bach","year":"2013","unstructured":"Bach, B., Spritzer, A., Lutton, E., Fekete, J.-D.: Interactive random graph generation with evolutionary algorithms. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 541\u2013552. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-36763-2_48"},{"doi-asserted-by":"crossref","unstructured":"Bailey, A., Ventresca, M., Ombuki-Berman, B.: Automatic generation of graph models for complex networks by genetic programming. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, pp. 711\u2013718. ACM (2012)","key":"45_CR3","DOI":"10.1145\/2330163.2330263"},{"doi-asserted-by":"crossref","unstructured":"Capot\u0103, M., Hegeman, T., Iosup, A., Prat-P\u00e9rez, A., Erling, O., Boncz, P.: Graphalytics: a big data benchmark for graph-processing platforms. In: Proceedings of the GRADES 2015, pp. 7:1\u20137:6. ACM (2015)","key":"45_CR4","DOI":"10.1145\/2764947.2764954"},{"issue":"1","key":"45_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: laws, generators, and algorithms. ACM Comput. Surv. (CSUR) 38(1), 2 (2006)","journal-title":"ACM Comput. Surv. (CSUR)"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SDM, vol. 4, pp. 442\u2013446. SIAM (2004)","key":"45_CR6","DOI":"10.1137\/1.9781611972740.43"},{"unstructured":"T. G. S. Committee: The graph 500 list, 2010\u20132016","key":"45_CR7"},{"doi-asserted-by":"crossref","unstructured":"Elser, B., Montresor, A.: An evaluation study of bigdata frameworks for graph processing. In: Big Data (2013)","key":"45_CR8","DOI":"10.1109\/BigData.2013.6691555"},{"key":"45_CR9","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"doi-asserted-by":"crossref","unstructured":"Erling, O., Averbuch, A., Larriba-Pey, J., Chafi, H., Gubichev, A., Prat, A., Pham, M.-D., Boncz, P.: The LDBC social network benchmark: interactive workload. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD 2015, pp. 619\u2013630. ACM, New York (2015)","key":"45_CR10","DOI":"10.1145\/2723372.2742786"},{"issue":"7","key":"45_CR11","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1162\/neco.2010.06-09-1042","volume":"22","author":"J Gauci","year":"2010","unstructured":"Gauci, J., Stanley, K.O.: Autonomous evolution of topographic regularities in artificial neural networks. Neural Comput. 22(7), 1860\u20131898 (2010)","journal-title":"Neural Comput."},{"doi-asserted-by":"crossref","unstructured":"Guo, Y., Biczak, M., Varbanescu, A.L., Iosup, A., Martella, C., Willke, T.L.: How well do graph-processing platforms perform? An empirical performance evaluation and analysis. In: IPDPS (2014)","key":"45_CR12","DOI":"10.1109\/IPDPS.2014.49"},{"doi-asserted-by":"crossref","unstructured":"Guo, Y., Varbanescu, A.L., Iosup, A., Epema, D.: An empirical performance evaluation of GPU-enabled graph-processing systems. In: CCGrid 2015 (2015)","key":"45_CR13","DOI":"10.1109\/CCGrid.2015.20"},{"key":"45_CR14","first-page":"1047","volume":"7","author":"M Han","year":"2014","unstructured":"Han, M., Daudjee, K., Ammar, K., Ozsu, M.T., Wang, X., Jin, T.: An experimental comparison of pregel-like graph processing systems. VLDB 7, 1047\u20131058 (2014)","journal-title":"VLDB"},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"026107","DOI":"10.1103\/PhysRevE.65.026107","volume":"65","author":"P Holme","year":"2002","unstructured":"Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Phys. Rev. E 65(2), 026107 (2002)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Hong, S., Depner, S., Manhardt, T., Van Der Lugt, J., Verstraaten, M., Chafi, H.: PGX.D: a fast distributed graph processing engine. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, p. 58. ACM (2015)","key":"45_CR16","DOI":"10.1145\/2807591.2807620"},{"doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the Koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, WWW 2013 Companion, pp. 1343\u20131350 (2013)","key":"45_CR17","DOI":"10.1145\/2487788.2488173"},{"key":"45_CR18","volume-title":"Stanford Network Analysis Platform (SNAP)","author":"J Leskovec","year":"2006","unstructured":"Leskovec, J.: Stanford Network Analysis Platform (SNAP). Stanford University, Stanford (2006)"},{"key":"45_CR19","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985\u20131042 (2010)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Lothian, J., Powers, S., Sullivan, B.D., Baker, M., Schrock, J., Poole, S.W.: Synthetic graph generation for data-intensive HPC benchmarking: background and framework (2013)","key":"45_CR20","DOI":"10.2172\/1122669"},{"key":"45_CR21","first-page":"281","volume":"8","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Cheng, J., Yan, D., Wu, H.: Large-scale distributed graph computing systems: an experimental evaluation. VLDB 8, 281\u2013292 (2014)","journal-title":"VLDB"},{"issue":"253","key":"45_CR22","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1080\/01621459.1951.10500769","volume":"46","author":"FJ Massey Jr","year":"1951","unstructured":"Massey Jr., F.J.: The Kolmogorov-Smirnov test for goodness of fit. J. Am. Stat. Assoc. 46(253), 68\u201378 (1951)","journal-title":"J. Am. Stat. Assoc."},{"doi-asserted-by":"crossref","unstructured":"Satish, N., Sundaram, N., Patwary, M.A., Seo, J., Park, J., Hassaan, M.A., Sengupta, S., Yin, Z., Dubey, P.: Navigating the maze of graph analytics frameworks using massive graph datasets. In: SIGMOD (2014)","key":"45_CR23","DOI":"10.1145\/2588555.2610518"},{"issue":"2","key":"45_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1162\/artl.2009.15.2.15202","volume":"15","author":"KO Stanley","year":"2009","unstructured":"Stanley, K.O., D\u2019Ambrosio, D.B., Gauci, J.: A hypercube-based encoding for evolving large-scale neural networks. Artif. Life 15(2), 185\u2013212 (2009)","journal-title":"Artif. Life"},{"issue":"2","key":"45_CR25","first-page":"3","volume":"1","author":"KO Stanley","year":"1996","unstructured":"Stanley, K.O., Miikkulainen, R.: Efficient reinforcement learning through evolving neural network topologies. Netw. (Phenotype) 1(2), 3 (1996)","journal-title":"Netw. (Phenotype)"},{"issue":"2","key":"45_CR26","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."},{"doi-asserted-by":"crossref","unstructured":"Varbanescu, A.L., Verstraaten, M., Penders, A., Sips, H., de Laat, C.: Can portability improve performance? An empirical study of parallel graph analytics. In: ICPE 2015 (2015)","key":"45_CR27","DOI":"10.1145\/2668930.2688042"},{"key":"45_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-319-27308-2_43","volume-title":"Euro-Par 2015: Parallel Processing Workshops","author":"M Verstraaten","year":"2015","unstructured":"Verstraaten, M., Varbanescu, A.L., de Laat, C.: Quantifying the performance impact of graph structure on neighbour iteration strategies for pagerank. In: Hunold, S., et al. (eds.) Euro-Par 2015. LNCS, vol. 9523, pp. 528\u2013540. Springer, Cham (2015). doi:10.1007\/978-3-319-27308-2_43"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58943-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:29:14Z","timestamp":1622161754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58943-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319589428","9783319589435"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58943-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}