{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:22Z","timestamp":1750220722520,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3398682.3399161","type":"proceedings-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T19:25:57Z","timestamp":1591730757000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Smooth Kronecker"],"prefix":"10.1145","author":[{"given":"Vaastav","family":"Anand","sequence":"first","affiliation":[{"name":"University of British Columbia"}]},{"given":"Puneet","family":"Mehrotra","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]},{"given":"Daniel","family":"Margo","sequence":"additional","affiliation":[{"name":"Google and Harvard University"}]},{"given":"Margo","family":"Seltzer","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_48"},{"key":"e_1_3_2_1_2_1","volume-title":"Emergence of scaling in random networks. science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. science 286, 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science 286, 5439 (1999), 509--512."},{"volume-title":"SDM","author":"Chakrabarti Deepayan","key":"e_1_3_2_1_3_1","unstructured":"Deepayan Chakrabarti , Yiping Zhan , and Christos Faloutsos . 2004. R-MAT: A Recursive Model for Graph Mining .. In SDM , Vol. 4 . SIAM , 442--446. Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. 2004. R-MAT: A Recursive Model for Graph Mining.. In SDM, Vol. 4. SIAM, 442--446."},{"key":"e_1_3_2_1_4_1","unstructured":"SNAP\n  : Stanford Large Network Dataset Collection. [n.d.]. High-energy physics theory citation network. https:\/\/snap.stanford.edu\/data\/cit-HepTh.html.  SNAP: Stanford Large Network Dataset Collection. [n.d.]. High-energy physics theory citation network. https:\/\/snap.stanford.edu\/data\/cit-HepTh.html."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16720-1_4"},{"key":"e_1_3_2_1_6_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s Paul","year":"1960","unstructured":"Paul Erd\u00f6s and Alfr\u00e9d R\u00e9nyi . 1960 . On the evolution of random graphs . Publ. Math. Inst. Hung. Acad. Sci 5 , 17 - 61 (1960), 43. Paul Erd\u00f6s and Alfr\u00e9d R\u00e9nyi. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5, 17-61 (1960), 43.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.06.005"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"volume-title":"Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT '15)","author":"Khorasani Farzad","key":"e_1_3_2_1_9_1","unstructured":"Farzad Khorasani , Rajiv Gupta , and Laxmi N. Bhuyan . 2015. Scalable SIMD-Efficient Graph Processing on GPUs . In Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT '15) . 39--50. Farzad Khorasani, Rajiv Gupta, and Laxmi N. Bhuyan. 2015. Scalable SIMD-Efficient Graph Processing on GPUs. In Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT '15). 39--50."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2012.625257"},{"key":"e_1_3_2_1_11_1","first-page":"31","article-title":"GraphChi: Large-Scale Graph Computation on Just a PC","volume":"12","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola , Guy E Blelloch , and Carlos Guestrin . 2012 . GraphChi: Large-Scale Graph Computation on Just a PC .. In Operating Systems Design and Implementation , Vol. 12. 31 -- 46 . Aapo Kyrola, Guy E Blelloch, and Carlos Guestrin. 2012. GraphChi: Large-Scale Graph Computation on Just a PC.. In Operating Systems Design and Implementation, Vol. 12. 31--46.","journal-title":"Operating Systems Design and Implementation"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_17"},{"key":"e_1_3_2_1_13_1","first-page":"985","article-title":"Kronecker graphs: An approach to modeling networks","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec , Deepayan Chakrabarti , Jon Kleinberg , Christos Faloutsos , and Zoubin Ghahramani . 2010 . Kronecker graphs: An approach to modeling networks . Journal of Machine Learning Research 11 , Feb (2010), 985 -- 1042 . Jure Leskovec, Deepayan Chakrabarti, Jon Kleinberg, Christos Faloutsos, and Zoubin Ghahramani. 2010. Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research 11, Feb (2010), 985--1042.","journal-title":"Journal of Machine Learning Research 11"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273559"},{"key":"e_1_3_2_1_15_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_18_1","volume-title":"LLAMA: Efficient Graph Analytics Using Large Multiversioned Arrays. In International Conference on Data Engineering. IEEE.","author":"Macko Peter","year":"2015","unstructured":"Peter Macko , Virendra J Marathe , Daniel W Margo , and Margo I Seltzer . 2015 . LLAMA: Efficient Graph Analytics Using Large Multiversioned Arrays. In International Conference on Data Engineering. IEEE. Peter Macko, Virendra J Marathe, Daniel W Margo, and Margo I Seltzer. 2015. LLAMA: Efficient Graph Analytics Using Large Multiversioned Arrays. In International Conference on Data Engineering. IEEE."},{"key":"e_1_3_2_1_20_1","volume-title":"Introducing the graph 500","author":"Murphy Richard C","year":"2010","unstructured":"Richard C Murphy , Kyle B Wheeler , Brian W Barrett , and James A Ang . 2010. Introducing the graph 500 . Cray User's Group (CUG) ( 2010 ). Richard C Murphy, Kyle B Wheeler, Brian W Barrett, and James A Ang. 2010. Introducing the graph 500. Cray User's Group (CUG) (2010)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064014"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.23"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_26_1","first-page":"3","article-title":"Asynchronous Large-Scale Graph Processing Made Easy","volume":"13","author":"Wang Guozhang","year":"2013","unstructured":"Guozhang Wang , Wenlei Xie , Alan J Demers , and Johannes Gehrke . 2013 . Asynchronous Large-Scale Graph Processing Made Easy .. In CIDR , Vol. 13. 3 -- 6 . Guozhang Wang, Wenlei Xie, Alan J Demers, and Johannes Gehrke. 2013. Asynchronous Large-Scale Graph Processing Made Easy.. In CIDR, Vol. 13. 3--6.","journal-title":"CIDR"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399161","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398682.3399161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:31Z","timestamp":1750199611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399161"}},"subtitle":["Solving the Combing Problem in Kronecker Graphs"],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":25,"alternative-id":["10.1145\/3398682.3399161","10.1145\/3398682"],"URL":"https:\/\/doi.org\/10.1145\/3398682.3399161","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}