{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:02:19Z","timestamp":1768881739268,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":147,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,17]],"date-time":"2019-11-17T00:00:00Z","timestamp":1573948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council (ERC)","award":["678880"],"award-info":[{"award-number":["678880"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,17]]},"DOI":"10.1145\/3295500.3356182","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Slim graph"],"prefix":"10.1145","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Weber","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lukas","family":"Gianinazzi","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Gerstenberger","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrey","family":"Ivanov","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishai","family":"Oltchik","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n.d.]. Hyperlink Graph 2012. http:\/\/webdatacommons.org\/hyperlinkgraph\/2012-08\/download.html.  [n.d.]. Hyperlink Graph 2012. http:\/\/webdatacommons.org\/hyperlinkgraph\/2012-08\/download.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.40"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_4_1","volume-title":"Constructing light spanners deterministically in near-linear time. arXiv preprint arXiv.1709.01960","author":"Alstrup Stephen","year":"2017","unstructured":"Stephen Alstrup , S\u00f8ren Dahlgaard , Arnold Filtser , Morten St\u00f6ckel , and Christian Wulff-Nilsen . 2017. Constructing light spanners deterministically in near-linear time. arXiv preprint arXiv.1709.01960 ( 2017 ). Stephen Alstrup, S\u00f8ren Dahlgaard, Arnold Filtser, Morten St\u00f6ckel, and Christian Wulff-Nilsen. 2017. Constructing light spanners deterministically in near-linear time. arXiv preprint arXiv.1709.01960 (2017)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2805875.2805976"},{"key":"e_1_3_2_1_6_1","volume-title":"An efficient algorithm for unweighted spectral graph sparsification. arXiv preprint arXiv:1410A273","author":"Anderson David G","year":"2014","unstructured":"David G Anderson , Ming Gu , and Christopher Melgaard . 2014. An efficient algorithm for unweighted spectral graph sparsification. arXiv preprint arXiv:1410A273 ( 2014 ). David G Anderson, Ming Gu, and Christopher Melgaard. 2014. An efficient algorithm for unweighted spectral graph sparsification. arXiv preprint arXiv:1410A273 (2014)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777879.1777889"},{"key":"e_1_3_2_1_8_1","unstructured":"Mich\u00e8le Basseville. 2010. Divergence measures for statistical data processing. (2010).  Mich\u00e8le Basseville. 2010. Divergence measures for statistical data processing. (2010)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868242"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20130"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-015-0472-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"e_1_3_2_1_13_1","volume-title":"The GAP benchmark suite. arXiv preprint arXiv.1508.03619","author":"Beamer Scott","year":"2015","unstructured":"Scott Beamer , Krste Asanovi\u0107 , and David Patterson . 2015. The GAP benchmark suite. arXiv preprint arXiv.1508.03619 ( 2015 ). Scott Beamer, Krste Asanovi\u0107, and David Patterson. 2015. The GAP benchmark suite. arXiv preprint arXiv.1508.03619 (2015)."},{"key":"e_1_3_2_1_14_1","volume-title":"Scalable Approximation Algorithm for Graph Summarization. pacific-asia conference on knowledge discovery and data mining","author":"Beg Maham Anwar","year":"2018","unstructured":"Maham Anwar Beg , Muhammad Ahmad , Arif Zaman , and Imdadullah Khan . 2018. Scalable Approximation Algorithm for Graph Summarization. pacific-asia conference on knowledge discovery and data mining ( 2018 ), 502--514. Maham Anwar Beg, Muhammad Ahmad, Arif Zaman, and Imdadullah Khan. 2018. Scalable Approximation Algorithm for Graph Summarization. pacific-asia conference on knowledge discovery and data mining (2018), 502--514."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM, 47--55","author":"Bencz\u00far Andr\u00e1s A","year":"1996","unstructured":"Andr\u00e1s A Bencz\u00far and David R Karger . 1996 . Approximating st minimum cuts in O (n 2) time . In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM, 47--55 . Andr\u00e1s A Bencz\u00far and David R Karger. 1996. Approximating st minimum cuts in O (n 2) time. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM, 47--55."},{"key":"e_1_3_2_1_16_1","volume-title":"34th Symposium on Theoretical Aspects of Computer Science (STACS","author":"Bera Suman K","year":"2017","unstructured":"Suman K Bera and Amit Chakrabarti . 2017 . Towards tighter space bounds for counting triangles and other substructures in graph streams . In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Suman K Bera and Amit Chakrabarti. 2017. Towards tighter space bounds for counting triangles and other substructures in graph streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_17_1","volume-title":"Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations. arXiv preprint arXiv:1806.01799","author":"Besta Maciej","year":"2018","unstructured":"Maciej Besta and Torsten Hoefler . 2018. Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations. arXiv preprint arXiv:1806.01799 ( 2018 ). Maciej Besta and Torsten Hoefler. 2018. Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations. arXiv preprint arXiv:1806.01799 (2018)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243198"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963493"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_22_1","volume-title":"KADABRA is an adaptive algorithm for betweenness via random approximation. arXiv preprint arXiv:1604.08553","author":"Borassi Michele","year":"2016","unstructured":"Michele Borassi and Emanuele Natale . 2016. KADABRA is an adaptive algorithm for betweenness via random approximation. arXiv preprint arXiv:1604.08553 ( 2016 ). Michele Borassi and Emanuele Natale. 2016. KADABRA is an adaptive algorithm for betweenness via random approximation. arXiv preprint arXiv:1604.08553 (2016)."},{"key":"e_1_3_2_1_23_1","volume-title":"Concentration inequalities: A nonasymptotic theory of independence","author":"Boucheron St\u00e9phane","unstructured":"St\u00e9phane Boucheron , G\u00e1bor Lugosi , and Pascal Massart . 2013. Concentration inequalities: A nonasymptotic theory of independence . Oxford university press . St\u00e9phane Boucheron, G\u00e1bor Lugosi, and Pascal Massart. 2013. Concentration inequalities: A nonasymptotic theory of independence. Oxford university press."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"e_1_3_2_1_25_1","volume-title":"SPIRE","volume":"9","author":"Brisaboa Nieves R","year":"2009","unstructured":"Nieves R Brisaboa , Susana Ladra , and Gonzalo Navarro . 2009 . k2-Trees for Compact Web Graph Representation .. In SPIRE , Vol. 9 . Springer, 18--30. Nieves R Brisaboa, Susana Ladra, and Gonzalo Navarro. 2009. k2-Trees for Compact Web Graph Representation.. In SPIRE, Vol. 9. Springer, 18--30."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_1_27_1","volume-title":"International Conference on Machine Learning.","author":"Calandriello Daniele","year":"2018","unstructured":"Daniele Calandriello , Ioannis Koutis , Alessandro Lazaric , and Michal Valko . 2018 . Improved large-scale graph learning through ridge spectral sparsification . In International Conference on Machine Learning. Daniele Calandriello, Ioannis Koutis, Alessandro Lazaric, and Michal Valko. 2018. Improved large-scale graph learning through ridge spectral sparsification. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513591.2513654"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212758"},{"key":"e_1_3_2_1_30_1","volume-title":"The Sparsest Additive Spanner via Multiple Weighted BFS Trees. arXiv preprint arXiv:1811.01997","author":"Censor-Hillel Keren","year":"2018","unstructured":"Keren Censor-Hillel , Ami Paz , and Noam Ravid . 2018. The Sparsest Additive Spanner via Multiple Weighted BFS Trees. arXiv preprint arXiv:1811.01997 ( 2018 ). Keren Censor-Hillel, Ami Paz, and Noam Ravid. 2018. The Sparsest Additive Spanner via Multiple Weighted BFS Trees. arXiv preprint arXiv:1811.01997 (2018)."},{"key":"e_1_3_2_1_31_1","first-page":"1","article-title":"Comprehensive survey on distance\/similarity measures between probability density functions","volume":"1","author":"Cha Sung-Hyuk","year":"2007","unstructured":"Sung-Hyuk Cha . 2007 . Comprehensive survey on distance\/similarity measures between probability density functions . City 1 , 2 (2007), 1 . Sung-Hyuk Cha. 2007. Comprehensive survey on distance\/similarity measures between probability density functions. City 1, 2 (2007), 1.","journal-title":"City"},{"key":"e_1_3_2_1_32_1","series-title":"SIAM Journal on computing 34, 6","volume-title":"Approximating the minimum spanning tree weight in sublinear time","author":"Chazelle Bernard","year":"2005","unstructured":"Bernard Chazelle , Ronitt Rubinfeld , and Luca Trevisan . 2005. Approximating the minimum spanning tree weight in sublinear time . SIAM Journal on computing 34, 6 ( 2005 ), 1370--1379. Bernard Chazelle, Ronitt Rubinfeld, and Luca Trevisan. 2005. Approximating the minimum spanning tree weight in sublinear time. SIAM Journal on computing 34, 6 (2005), 1370--1379."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.78"},{"key":"e_1_3_2_1_34_1","volume-title":"Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 752--764","author":"Chehreghani Mostafa Haghir","year":"2018","unstructured":"Mostafa Haghir Chehreghani , Albert Bifet , and Talel Abdessalem . 2018 . Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 752--764 . Mostafa Haghir Chehreghani, Albert Bifet, and Talel Abdessalem. 2018. Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 752--764."},{"key":"e_1_3_2_1_35_1","volume-title":"Matt Fredrikson, Mihai Christodorescu, Xifeng Yan, and Jiawei Han.","author":"Chen Chen","year":"2009","unstructured":"Chen Chen , Cindy Xide Lin , Matt Fredrikson, Mihai Christodorescu, Xifeng Yan, and Jiawei Han. 2009 . Mining graph patterns efficiently via randomized summaries. very large data bases 2, 1 (2009), 742--753. Chen Chen, Cindy Xide Lin, Matt Fredrikson, Mihai Christodorescu, Xifeng Yan, and Jiawei Han. 2009. Mining graph patterns efficiently via randomized summaries. very large data bases 2, 1 (2009), 742--753."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00042"},{"key":"e_1_3_2_1_39_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.020"},{"key":"e_1_3_2_1_41_1","volume-title":"Elements of information theory","author":"Cover Thomas M","unstructured":"Thomas M Cover and Joy A Thomas . 2012. Elements of information theory . John Wiley & Sons . Thomas M Cover and Joy A Thomas. 2012. Elements of information theory. John Wiley & Sons."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091042"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038911.67280.3f"},{"key":"e_1_3_2_1_44_1","volume-title":"The Shortest Path Problem: Ninth DIMLACS Implementation Challenge","author":"Demetrescu Camil","unstructured":"Camil Demetrescu , Andrew V Goldberg , and David S Johnson . 2009. The Shortest Path Problem: Ninth DIMLACS Implementation Challenge . Vol. 74 . American Math. Soc . Camil Demetrescu, Andrew V Goldberg, and David S Johnson. 2009. The Shortest Path Problem: Ninth DIMLACS Implementation Challenge. Vol. 74. American Math. Soc."},{"key":"e_1_3_2_1_45_1","volume-title":"A survey of parallel graph processing frameworks","author":"Doekemeijer Niels","year":"2014","unstructured":"Niels Doekemeijer and Ana Lucia Varbanescu . 2014. A survey of parallel graph processing frameworks . Delft University of Technology ( 2014 ), 21. Niels Doekemeijer and Ana Lucia Varbanescu. 2014. A survey of parallel graph processing frameworks. Delft University of Technology (2014), 21."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212760"},{"key":"e_1_3_2_1_47_1","volume-title":"Amaia Nazabal Ruiz Diaz, and Romain Vuillemot","author":"Dumbrava Stefania","year":"2018","unstructured":"Stefania Dumbrava , Angela Bonifati , Amaia Nazabal Ruiz Diaz, and Romain Vuillemot . 2018 . Approximate Evaluation of Label-Constrained Reachability Queries . arXiv preprint arXiv.1811.11561 (2018). Stefania Dumbrava, Angela Bonifati, Amaia Nazabal Ruiz Diaz, and Romain Vuillemot. 2018. Approximate Evaluation of Label-Constrained Reachability Queries. arXiv preprint arXiv.1811.11561 (2018)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2466444"},{"key":"e_1_3_2_1_49_1","volume-title":"The 29th International Conference on Software Engineering and Knowledge Engineering.","author":"Ghizlane","year":"2017","unstructured":"Ghizlane ECHBARTHI and Hamamache KHEDDOUCI. 2017 . Lasas: an aggregated search based graph matching approach . In The 29th International Conference on Software Engineering and Knowledge Engineering. Ghizlane ECHBARTHI and Hamamache KHEDDOUCI. 2017. Lasas: an aggregated search based graph matching approach. In The 29th International Conference on Software Engineering and Knowledge Engineering."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054389"},{"key":"e_1_3_2_1_51_1","first-page":"4","article-title":"Efficient algorithms for constructing very sparse spanners and emulators","volume":"15","author":"Elkin Michael","year":"2018","unstructured":"Michael Elkin and Ofer Neiman . 2018 . Efficient algorithms for constructing very sparse spanners and emulators . ACM Transactions on Algorithms (TALG) 15 , 1 (2018), 4 . Michael Elkin and Ofer Neiman. 2018. Efficient algorithms for constructing very sparse spanners and emulators. ACM Transactions on Algorithms (TALG) 15, 1 (2018), 4.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796308217"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213855"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_33"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898094"},{"key":"e_1_3_2_1_56_1","volume-title":"Finding cliques in social networks: A new distribution-free model. arXiv preprint arXiv:1804.07431","author":"Fox Jacob","year":"2018","unstructured":"Jacob Fox , Tim Roughgarden , C Seshadhri , Fan Wei , and Nicole Wein . 2018. Finding cliques in social networks: A new distribution-free model. arXiv preprint arXiv:1804.07431 ( 2018 ). Jacob Fox, Tim Roughgarden, C Seshadhri, Fan Wei, and Nicole Wein. 2018. Finding cliques in social networks: A new distribution-free model. arXiv preprint arXiv:1804.07431 (2018)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-5588-7"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791204.2791213"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/571902"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/2688283.2688284"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367570"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90246-6"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3199523"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/FiCloud.2015.64"},{"key":"e_1_3_2_1_65_1","volume-title":"A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865","author":"Hu Pili","year":"2013","unstructured":"Pili Hu and Wing Cheong Lau . 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865 ( 2013 ). Pili Hu and Wing Cheong Lau. 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865 (2013)."},{"key":"e_1_3_2_1_66_1","volume-title":"High-Performance Triangle Counting on GPUs. In 2018 IEEE High Performance extreme Computing Conference (HPEC)","author":"Hu Yang","unstructured":"Yang Hu , Hang Liu , and H Howie Huang . 2018. High-Performance Triangle Counting on GPUs. In 2018 IEEE High Performance extreme Computing Conference (HPEC) . IEEE , 1--5. Yang Hu, Hang Liu, and H Howie Huang. 2018. High-Performance Triangle Counting on GPUs. In 2018 IEEE High Performance extreme Computing Conference (HPEC). IEEE, 1--5."},{"key":"e_1_3_2_1_67_1","volume-title":"Approximate Graph Pattern Mining at Scale. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 745--761.","author":"Iyer Anand Padmanabha","unstructured":"Anand Padmanabha Iyer , Zaoxing Liu , Xin Jin , Shivaram Venkataraman , Vladimir Braverman , and Ion Stoica . 2018. {ASAP} : Fast , Approximate Graph Pattern Mining at Scale. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 745--761. Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018. {ASAP}: Fast, Approximate Graph Pattern Mining at Scale. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 745--761."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210259.3210269"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.159"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421397"},{"key":"e_1_3_2_1_71_1","volume-title":"A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. ACM Transactions on Knowledge Discovery from Data (TKDD) 9, 3","author":"Jha Madhav","year":"2015","unstructured":"Madhav Jha , C Seshadhri , and Ali Pinar . 2015. A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. ACM Transactions on Knowledge Discovery from Data (TKDD) 9, 3 ( 2015 ), 15. Madhav Jha, C Seshadhri, and Ali Pinar. 2015. A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. ACM Transactions on Knowledge Discovery from Data (TKDD) 9, 3 (2015), 15."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_72"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947623"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331608"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9396-1"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"e_1_3_2_1_77_1","first-page":"14","article-title":"Simple parallel and distributed algorithms for spectral graph sparsification","volume":"3","author":"Koutis Ioannis","year":"2016","unstructured":"Ioannis Koutis and Shen Chen Xu . 2016 . Simple parallel and distributed algorithms for spectral graph sparsification . ACM Transactions on Parallel Computing (TOPC) 3 , 2 (2016), 14 . Ioannis Koutis and Shen Chen Xu. 2016. Simple parallel and distributed algorithms for spectral graph sparsification. ACM Transactions on Parallel Computing (TOPC) 3, 2 (2016), 14.","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"key":"e_1_3_2_1_78_1","volume-title":"Information theory and statistics","author":"Kullback Solomon","unstructured":"Solomon Kullback . 1997. Information theory and statistics . Courier Corporation . Solomon Kullback. 1997. Information theory and statistics. Courier Corporation."},{"key":"e_1_3_2_1_79_1","volume-title":"Utility-driven graph summarization. very large data bases 12, 4","author":"Ashwin Kumar K.","year":"2018","unstructured":"K. Ashwin Kumar and Petros Efstathopoulos . 2018. Utility-driven graph summarization. very large data bases 12, 4 ( 2018 ), 335--347. K. Ashwin Kumar and Petros Efstathopoulos. 2018. Utility-driven graph summarization. very large data bases 12, 4 (2018), 335--347."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00043"},{"key":"e_1_3_2_1_82_1","volume-title":"Yon Dohn Chung, and Bongki Moon","author":"Lee Kyong-Ha","year":"2012","unstructured":"Kyong-Ha Lee , Yoon-Joon Lee , Hyunsik Choi , Yon Dohn Chung, and Bongki Moon . 2012 . Parallel data processing with MapReduce: a survey. AcM sIGMoD Record 40, 4 (2012), 11--20. Kyong-Ha Lee, Yoon-Joon Lee, Hyunsik Choi, Yon Dohn Chung, and Bongki Moon. 2012. Parallel data processing with MapReduce: a survey. AcM sIGMoD Record 40, 4 (2012), 11--20."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1061850"},{"key":"e_1_3_2_1_84_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Lenzen Christoph","year":"2018","unstructured":"Christoph Lenzen and Reut Levi . 2018 . A Centralized Local Algorithm for the Sparse Spanning Graph Problem. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Christoph Lenzen and Reut Levi. 2018. A Centralized Local Algorithm for the Sparse Spanning Graph Problem. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_86_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_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00059"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398630"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661862"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626407002843"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_94_1","volume-title":"Community Preserving Lossy Compression of Social Networks. In 2012 IEEE 12th International Conference on Data Mining. 509--518","author":"Maserrat Hossein","year":"2012","unstructured":"Hossein Maserrat and Jian Pei . 2012 . Community Preserving Lossy Compression of Social Networks. In 2012 IEEE 12th International Conference on Data Mining. 509--518 . Hossein Maserrat and Jian Pei. 2012. Community Preserving Lossy Compression of Social Networks. In 2012 IEEE 12th International Conference on Data Mining. 509--518."},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902283"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"e_1_3_2_1_98_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_99_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90011-Z"},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_103_1","volume-title":"Local Computation Algorithms for Spanners. In 10th Innovations in Theoretical Computer Science Conference (ITCS","author":"Parter Merav","year":"2018","unstructured":"Merav Parter , Ronitt Rubinfeld , Ali Vakilian , and Anak Yodpinyanee . 2018 . Local Computation Algorithms for Spanners. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. 2018. Local Computation Algorithms for Spanners. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"crossref","unstructured":"Aduri Pavan Srikanta Tirthapura etal 2013. Counting and sampling triangles from a graph stream. (2013).  Aduri Pavan Srikanta Tirthapura et al. 2013. Counting and sampling triangles from a graph stream. (2013).","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130114"},{"key":"e_1_3_2_1_106_1","series-title":"SIAM Journal on computing 18, 4","volume-title":"An optimal synchronizer for the hypercube","author":"Peleg David","year":"1989","unstructured":"David Peleg and Jeffrey D Ullman . 1989. An optimal synchronizer for the hypercube . SIAM Journal on computing 18, 4 ( 1989 ), 740--747. David Peleg and Jeffrey D Ullman. 1989. An optimal synchronizer for the hypercube. SIAM Journal on computing 18, 4 (1989), 740--747."},{"key":"e_1_3_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0091-7"},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.108"},{"key":"e_1_3_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_1_110_1","volume-title":"The probabilistic basis of Jaccard's index of similarity. Systematic biology 45, 3","author":"Real Raimundo","year":"1996","unstructured":"Raimundo Real and Juan M Vargas . 1996. The probabilistic basis of Jaccard's index of similarity. Systematic biology 45, 3 ( 1996 ), 380--385. Raimundo Real and Juan M Vargas. 1996. The probabilistic basis of Jaccard's index of similarity. Systematic biology 45, 3 (1996), 380--385."},{"key":"e_1_3_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0468-8"},{"key":"e_1_3_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0423-0"},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208351"},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.06.001"},{"key":"e_1_3_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_3_2_1_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/2458523.2458531"},{"key":"e_1_3_2_1_118_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.15"},{"key":"e_1_3_2_1_119_1","volume-title":"A simpler sublinear algorithm for approximating the triangle count. arXiv preprint arXiv:1505.01927","author":"Seshadhri C","year":"2015","unstructured":"C Seshadhri . 2015. A simpler sublinear algorithm for approximating the triangle count. arXiv preprint arXiv:1505.01927 ( 2015 ). C Seshadhri. 2015. A simpler sublinear algorithm for approximating the triangle count. arXiv preprint arXiv:1505.01927 (2015)."},{"key":"e_1_3_2_1_120_1","volume-title":"Proceedings of the SIAM Conference on Data Mining","volume":"4","author":"Seshadhri Comandur","year":"2013","unstructured":"Comandur Seshadhri , Ali Pinar , and Tamara G Kolda . 2013 . Fast triangle counting through wedge sampling . In Proceedings of the SIAM Conference on Data Mining , Vol. 4 . 5. Comandur Seshadhri, Ali Pinar, and Tamara G Kolda. 2013. Fast triangle counting through wedge sampling. In Proceedings of the SIAM Conference on Data Mining, Vol. 4. 5."},{"key":"e_1_3_2_1_121_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11224"},{"key":"e_1_3_2_1_122_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733090"},{"key":"e_1_3_2_1_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/3128571"},{"key":"e_1_3_2_1_124_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313402"},{"key":"e_1_3_2_1_125_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMSCS.2018.2795543"},{"key":"e_1_3_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.50"},{"key":"e_1_3_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.159"},{"key":"e_1_3_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"e_1_3_2_1_130_1","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"e_1_3_2_1_131_1","volume-title":"International Workshop on Languages and Compilers for Parallel Computing. Springer, 76--95","author":"Sui Xin","year":"2012","unstructured":"Xin Sui , Tsung-Hsien Lee , Joyce Jiyoung Whang , Berkant Savas , Saral Jain , Keshav Pingali , and Inderjit Dhillon . 2012 . Parallel clustered low-rank approximation of graphs and its application to link prediction . In International Workshop on Languages and Compilers for Parallel Computing. Springer, 76--95 . Xin Sui, Tsung-Hsien Lee, Joyce Jiyoung Whang, Berkant Savas, Saral Jain, Keshav Pingali, and Inderjit Dhillon. 2012. Parallel clustered low-rank approximation of graphs and its application to link prediction. In International Workshop on Languages and Compilers for Parallel Computing. Springer, 76--95."},{"key":"e_1_3_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0049949"},{"key":"e_1_3_2_1_133_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020566"},{"key":"e_1_3_2_1_134_1","volume-title":"Network compression by node and edge mergers. Bisociative Knowledge Discovery","author":"Toivonen Hannu","year":"2012","unstructured":"Hannu Toivonen , Fang Zhou , Aleksi Hartikainen , and Atte Hinkka . 2012. Network compression by node and edge mergers. Bisociative Knowledge Discovery ( 2012 ), 199--217. Hannu Toivonen, Fang Zhou, Aleksi Hartikainen, and Atte Hinkka. 2012. Network compression by node and edge mergers. Bisociative Knowledge Discovery (2012), 199--217."},{"key":"e_1_3_2_1_135_1","volume-title":"Gianmarco De Francisci Morales, and Ricardo Baeza-Yates","author":"Tsalouchidou Ioanna","year":"2018","unstructured":"Ioanna Tsalouchidou , Francesco Bonchi , Gianmarco De Francisci Morales, and Ricardo Baeza-Yates . 2018 . Scalable Dynamic Graph Summarization. IEEE Transactions on Knowledge and Data Engineering ( 2018), 1--1. Ioanna Tsalouchidou, Francesco Bonchi, Gianmarco De Francisci Morales, and Ricardo Baeza-Yates. 2018. Scalable Dynamic Graph Summarization. IEEE Transactions on Knowledge and Data Engineering (2018), 1--1."},{"key":"e_1_3_2_1_136_1","unstructured":"Charalampos E Tsourakakis. [n.d.]. Fast Counting of Triangles in Large Real Networks: Algorithms and Laws. cis. temple. edu ([n.d.]) 608--617.  Charalampos E Tsourakakis. [n.d.]. Fast Counting of Triangles in Large Real Networks: Algorithms and Laws. cis. temple. edu ([n.d.]) 608--617."},{"key":"e_1_3_2_1_137_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_138_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90126-4"},{"key":"e_1_3_2_1_139_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(94)00057-I"},{"key":"e_1_3_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1145\/2915516.2915521"},{"key":"e_1_3_2_1_141_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"e_1_3_2_1_142_1","volume-title":"Towards scalable spectral clustering via spectrum-preserving sparsification. arXiv preprint arXiv.1710.04584","author":"Wang Yongyu","year":"2017","unstructured":"Yongyu Wang and Zhuo Feng . 2017. Towards scalable spectral clustering via spectrum-preserving sparsification. arXiv preprint arXiv.1710.04584 ( 2017 ). Yongyu Wang and Zhuo Feng. 2017. Towards scalable spectral clustering via spectrum-preserving sparsification. arXiv preprint arXiv.1710.04584 (2017)."},{"key":"e_1_3_2_1_143_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091043"},{"key":"e_1_3_2_1_144_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"e_1_3_2_1_145_1","volume-title":"Fast Triangle Counting Using Cilk. In 2018 IEEE High Performance extreme Computing Conference (HPEC)","author":"Ya\u015far Abdurrahman","unstructured":"Abdurrahman Ya\u015far , Sivasankaran Rajamanickam , Michael Wolf , Jonathan Berry , and \u00dcmit V \u00c7ataly\u00fcrek . 2018. Fast Triangle Counting Using Cilk. In 2018 IEEE High Performance extreme Computing Conference (HPEC) . IEEE , 1--7. Abdurrahman Ya\u015far, Sivasankaran Rajamanickam, Michael Wolf, Jonathan Berry, and \u00dcmit V \u00c7ataly\u00fcrek. 2018. Fast Triangle Counting Using Cilk. In 2018 IEEE High Performance extreme Computing Conference (HPEC). IEEE, 1--7."},{"key":"e_1_3_2_1_146_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2427795"},{"key":"e_1_3_2_1_147_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2016.2591592"},{"key":"e_1_3_2_1_148_1","volume-title":"Towards Scalable Spectral Sparsification of Directed Graphs. arXiv preprint arXiv:1812.04165","author":"Zhang Ying","year":"2018","unstructured":"Ying Zhang , Zhiqiang Zhao , and Zhuo Feng . 2018. Towards Scalable Spectral Sparsification of Directed Graphs. arXiv preprint arXiv:1812.04165 ( 2018 ). Ying Zhang, Zhiqiang Zhao, and Zhuo Feng. 2018. Towards Scalable Spectral Sparsification of Directed Graphs. arXiv preprint arXiv:1812.04165 (2018)."},{"key":"e_1_3_2_1_149_1","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2017.1280089"}],"event":{"name":"SC '19: The International Conference for High Performance Computing, Networking, Storage, and Analysis","location":"Denver Colorado","acronym":"SC '19","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:13Z","timestamp":1750208533000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356182"}},"subtitle":["practical lossy graph compression for approximate graph processing, storage, and analytics"],"short-title":[],"issued":{"date-parts":[[2019,11,17]]},"references-count":147,"alternative-id":["10.1145\/3295500.3356182","10.1145\/3295500"],"URL":"https:\/\/doi.org\/10.1145\/3295500.3356182","relation":{},"subject":[],"published":{"date-parts":[[2019,11,17]]},"assertion":[{"value":"2019-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}