{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:52Z","timestamp":1740169192867,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Millennium Institute for Foundational Research on Data, Chile"},{"name":"CONICYT PFCHA\/BECA DE DOCTORADO NACIONAL\/2019","award":["21192157"],"award-info":[{"award-number":["21192157"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3009577","type":"journal-article","created":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T20:57:31Z","timestamp":1594846651000},"page":"130048-130065","source":"Crossref","is-referenced-by-count":4,"title":["R<sup>3<\/sup>MAT: A Rapid and Robust Graph Generator"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6740-9711","authenticated-orcid":false,"given":"Renzo","family":"Angles","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9943-2510","authenticated-orcid":false,"given":"Rodrigo","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6466-4541","authenticated-orcid":false,"given":"Roberto","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","article-title":"Linear work generation of R-MAT graphs","author":"h\u00fcbschle-schneider","year":"2019","journal-title":"arXiv 1905 03525"},{"key":"ref32","first-page":"8214","article-title":"PegasusN: A scalable and versatile graph mining system","author":"park","year":"2018","journal-title":"Proc Nat Conf Artif Intell (AAAI)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"journal-title":"Concrete Mathematics A Foundation for Computer Science","year":"1994","author":"graham","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/00018730601170527"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621942"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2873675"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2633993"},{"key":"ref15","first-page":"1","article-title":"Community structure and scale-free collections of Erd&#x00F6;s-R&#x00E9;nyi graphs","volume":"85","author":"seshadhri","year":"2012","journal-title":"Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Top"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"journal-title":"HPC Scalable Graph Analysis Benchmark V1 0","year":"2009","author":"bader","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484440"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2287076.2287104"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.15"},{"key":"ref4","first-page":"52","article-title":"Representation learning on graphs: Methods and applications","volume":"40","author":"hamilton","year":"2017","journal-title":"IEEE Data Eng Bull"},{"journal-title":"Graph 500","year":"2020","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2851604"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951406"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2015.96"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3078447.3078453"},{"journal-title":"Managing and Mining Graph Data","year":"2012","author":"aggarwal","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1132952.1132954"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2774798"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2200\/S00449ED1V01Y201209DMK006"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733067"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CASoN.2009.31"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.02.004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816703"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijhcs.2006.11.002"},{"key":"ref23","first-page":"10","article-title":"Detection theory for graphs","volume":"20","author":"miller","year":"2013","journal-title":"Lincoln Lab J"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/net.20417"},{"journal-title":"Boost C++ libraries","year":"2020","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09141251.pdf?arnumber=9141251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:54:29Z","timestamp":1639770869000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9141251\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3009577","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}