{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:22:22Z","timestamp":1780590142694,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Samsung Research Funding Center ofSamsung Electronics","award":["SRFC-IT1502-10"],"award-info":[{"award-number":["SRFC-IT1502-10"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,19]]},"DOI":"10.1145\/3219819.3220123","type":"proceedings-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:05:12Z","timestamp":1532005512000},"page":"2051-2059","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["EvoGraph"],"prefix":"10.1145","author":[{"given":"Himchan","family":"Park","sequence":"first","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science &Technology (DGIST), Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min-Soo","family":"Kim","sequence":"additional","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science &Technology (DGIST), Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"RTG: a recursive realistic graph generator using random typing Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Akoglu Leman"},{"key":"e_1_3_2_2_2_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999"},{"key":"e_1_3_2_2_3_1","volume-title":"SDM","author":"Chakrabarti Deepayan"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_2_5_1","volume-title":"Darwini: Generating realistic large-scale social graphs. arXiv preprint arXiv:1610.00664","author":"Edunov Sergey","year":"2016"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098128"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"ErdHos Paul","year":"1959","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"e_1_3_2_2_8_1","unstructured":"Li Gao Jia Wu Hong Yang Zhi Qiao Chuan Zhou and Yue Hu . 2016. Semi-Data-Driven Network Coarsening.. In IJCAI. 1483--1489.   Li Gao Jia Wu Hong Yang Zhi Qiao Chuan Zhou and Yue Hu . 2016. Semi-Data-Driven Network Coarsening.. In IJCAI. 1483--1489."},{"key":"e_1_3_2_2_9_1","unstructured":"Graph500 . 2017. Graph500 Benchmark. (2017). http:\/\/www.graph500.org\/  Graph500 . 2017. Graph500 Benchmark. (2017). http:\/\/www.graph500.org\/"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882964"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915204"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/130914218"},{"key":"e_1_3_2_2_13_1","volume-title":"2005 a. Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication","author":"Leskovec Jurij"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1756039"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064014"},{"key":"e_1_3_2_2_19_1","unstructured":"SNAP . 2017. Stanford Network Analysis Project. (2017). http:\/\/snap.stanford.edu\/  SNAP . 2017. Stanford Network Analysis Project. (2017). http:\/\/snap.stanford.edu\/"},{"key":"e_1_3_2_2_20_1","volume-title":"Networkit: An interactive tool suite for high-performance network analysis. arXiv preprint arXiv:1403.3005","author":"Staudt Christian L","year":"2014"},{"key":"e_1_3_2_2_21_1","volume-title":"Collective dynamics of 'small-world'networks. nature","author":"Watts Duncan J","year":"1998"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806849"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.191"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007328.3007333"},{"key":"e_1_3_2_2_25_1","unstructured":"JW Zhang and YC Tay . 2016 b. GSCALER: Synthetically Scaling A Given Graph.. EDBT. 53--64.  JW Zhang and YC Tay . 2016 b. GSCALER: Synthetically Scaling A Given Graph.. EDBT. 53--64."},{"key":"e_1_3_2_2_26_1","volume-title":"Gemini: A Computation-Centric Distributed Graph Processing System. OSDI. 301--316.","author":"Zhu Xiaowei","year":"2016"}],"event":{"name":"KDD '18: The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"London United Kingdom","acronym":"KDD '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220123","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3220123","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:30Z","timestamp":1750212450000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3220123"}},"subtitle":["An Effective and Efficient Graph Upscaling Method for Preserving Graph Properties"],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":26,"alternative-id":["10.1145\/3219819.3220123","10.1145\/3219819"],"URL":"https:\/\/doi.org\/10.1145\/3219819.3220123","relation":{},"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"2018-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}