{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:17:38Z","timestamp":1750220258501,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"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":[[2021,11,8]]},"DOI":"10.1145\/3487351.3489471","type":"proceedings-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:40:12Z","timestamp":1642624812000},"page":"540-544","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating 4-cliques in streaming graphs"],"prefix":"10.1145","author":[{"given":"Anmol","family":"Mann","sequence":"first","affiliation":[{"name":"University of Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[{"name":"University of Victoria, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_3_1","volume-title":"Fast, accurate and provable triangle counting in fully dynamic graph streams,\" TKDD'20","author":"Shin K.","year":"2020","unstructured":"K. Shin , S. Oh , J. Kim , B. Hooi , and C. Faloutsos , \" Fast, accurate and provable triangle counting in fully dynamic graph streams,\" TKDD'20 , vol. 14 , 02 2020 . K. Shin, S. Oh, J. Kim, B. Hooi, and C. Faloutsos, \"Fast, accurate and provable triangle counting in fully dynamic graph streams,\" TKDD'20, vol. 14, 02 2020."},{"key":"e_1_3_2_1_4_1","first-page":"1431","article-title":"Escape: Efficiently counting all 5-vertex subgraphs","author":"Pinar A.","year":"2017","unstructured":"A. Pinar , C. Seshadhri , and V. Vishal , \" Escape: Efficiently counting all 5-vertex subgraphs ,\" in WWW , 2017 , pp. 1431 -- 1440 . A. Pinar, C. Seshadhri, and V. Vishal, \"Escape: Efficiently counting all 5-vertex subgraphs,\" in WWW, 2017, pp. 1431--1440.","journal-title":"WWW"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_6_1","first-page":"598","article-title":"Counting arbitrary subgraphs in data streams","author":"Kane D.","year":"2012","unstructured":"D. Kane , K. Mehlhorn , T. Sauerwald , and H. Sun , \" Counting arbitrary subgraphs in data streams ,\" in ICALP , 2012 , pp. 598 -- 609 . D. Kane, K. Mehlhorn, T. Sauerwald, and H. Sun, \"Counting arbitrary subgraphs in data streams,\" in ICALP, 2012, pp. 598--609.","journal-title":"ICALP"},{"key":"e_1_3_2_1_7_1","first-page":"737","article-title":"Mining large networks with subgraph counting","volume":"12","author":"Bordino I.","year":"2008","unstructured":"I. Bordino , D. Donato , A. Gionis , and S. Leonardi , \" Mining large networks with subgraph counting ,\" in ICDM , 12 2008 , pp. 737 -- 742 . I. Bordino, D. Donato, A. Gionis, and S. Leonardi, \"Mining large networks with subgraph counting,\" in ICDM, 12 2008, pp. 737--742.","journal-title":"ICDM"},{"key":"e_1_3_2_1_8_1","first-page":"776","article-title":"Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams","author":"Stefani L. D.","year":"2017","unstructured":"L. D. Stefani , E. Terolli , and E. Upfal , \" Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams ,\" IEEE BigData 2017 , pp. 776 -- 786 , 2017. L. D. Stefani, E. Terolli, and E. Upfal, \"Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams,\" IEEE BigData 2017, pp. 776--786, 2017.","journal-title":"IEEE BigData"},{"key":"e_1_3_2_1_9_1","first-page":"425","volume-title":"ACM","author":"Teixeira C. H.","year":"2015","unstructured":"C. H. Teixeira , A. J. Fonseca , M. Serafini , G. Siganos , M. J. Zaki , and A. Aboulnaga , \" Arabesque: a system for distributed graph mining,\" in SOSP'15 . ACM , 2015 , pp. 425 -- 440 . C. H. Teixeira, A. J. Fonseca, M. Serafini, G. Siganos, M. J. Zaki, and A. Aboulnaga, \"Arabesque: a system for distributed graph mining,\" in SOSP'15. ACM, 2015, pp. 425--440."},{"key":"e_1_3_2_1_10_1","first-page":"02215","article-title":"Distributed estimation of graph 4-profiles","volume":"1510","author":"Elenberg E. R.","year":"2015","unstructured":"E. R. Elenberg , K. Shanmugam , M. Borokhovich , and A. G. Dimakis , \" Distributed estimation of graph 4-profiles ,\" CoRR , vol. abs\/ 1510 . 02215 , 2015 . [Online]. Available: http:\/\/arxiv.org\/abs\/1510.02215 E. R. Elenberg, K. Shanmugam, M. Borokhovich, and A. G. Dimakis, \"Distributed estimation of graph 4-profiles,\" CoRR, vol. abs\/1510.02215, 2015. [Online]. Available: http:\/\/arxiv.org\/abs\/1510.02215","journal-title":"CoRR"},{"volume-title":"Triest: Counting local and global triangles in fully dynamic streams with fixed memory size,\" TKDD'17)","author":"Stefani L. D.","key":"e_1_3_2_1_11_1","unstructured":"L. D. Stefani , A. Epasto , M. Riondato , and E. Upfal , \" Triest: Counting local and global triangles in fully dynamic streams with fixed memory size,\" TKDD'17) , vol. 11 , no. 4, p. 43, 2017. L. D. Stefani, A. Epasto, M. Riondato, and E. Upfal, \"Triest: Counting local and global triangles in fully dynamic streams with fixed memory size,\" TKDD'17), vol. 11, no. 4, p. 43, 2017."},{"key":"e_1_3_2_1_12_1","first-page":"745","volume-title":"Asap: Fast, approximate graph pattern mining at scale,\" in OSDI'18","author":"Iyer A. P.","year":"2018","unstructured":"A. P. Iyer , Z. Liu , X. Jin , S. Venkataraman , V. Braverman , and I. Stoica , \" Asap: Fast, approximate graph pattern mining at scale,\" in OSDI'18 , 2018 , pp. 745 -- 761 . A. P. Iyer, Z. Liu, X. Jin, S. Venkataraman, V. Braverman, and I. Stoica, \"Asap: Fast, approximate graph pattern mining at scale,\" in OSDI'18, 2018, pp. 745--761."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_14_1","first-page":"589","volume-title":"Listing k-cliques in sparse real-world graphs,\" in WWW'18","author":"Danisch M.","year":"2018","unstructured":"M. Danisch , O. Balalau , and M. Sozio , \" Listing k-cliques in sparse real-world graphs,\" in WWW'18 , 2018 , pp. 589 -- 598 . M. Danisch, O. Balalau, and M. Sozio, \"Listing k-cliques in sparse real-world graphs,\" in WWW'18, 2018, pp. 589--598."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"issue":"10","key":"e_1_3_2_1_16_1","first-page":"2466","article-title":"Graft: An efficient graphlet counting method for large graph analysis","volume":"26","author":"Rahman M.","year":"2014","unstructured":"M. Rahman , M. A. Bhuiyan , and M. Al Hasan , \" Graft: An efficient graphlet counting method for large graph analysis ,\" IEEE TKDE , vol. 26 , no. 10 , pp. 2466 -- 2478 , 2014 . M. Rahman, M. A. Bhuiyan, and M. Al Hasan, \"Graft: An efficient graphlet counting method for large graph analysis,\" IEEE TKDE, vol. 26, no. 10, pp. 2466--2478, 2014.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_3_2_1_19_1","first-page":"390","article-title":"Sahad: Subgraph analysis in massive networks using hadoop,\" in In IPDPS'12","author":"Zhao Z.","year":"2012","unstructured":"Z. Zhao , G. Wang , A. R. Butt , M. Khan , V. A. Kumar , and M. V. Marathe , \" Sahad: Subgraph analysis in massive networks using hadoop,\" in In IPDPS'12 . IEEE , 2012 , pp. 390 -- 401 . Z. Zhao, G. Wang, A. R. Butt, M. Khan, V. A. Kumar, and M. V. Marathe, \"Sahad: Subgraph analysis in massive networks using hadoop,\" in In IPDPS'12. IEEE, 2012, pp. 390--401.","journal-title":"IEEE"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014670.2014681"},{"key":"e_1_3_2_1_21_1","volume-title":"A fast and provable method for estimating clique counts using tur\u00e1n's theorem,\" WWW'17","author":"Jain S.","year":"2017","unstructured":"S. Jain and S. Comandur , \" A fast and provable method for estimating clique counts using tur\u00e1n's theorem,\" WWW'17 , 2017 . S. Jain and S. Comandur, \"A fast and provable method for estimating clique counts using tur\u00e1n's theorem,\" WWW'17, 2017."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_24_1","first-page":"5230","article-title":"Fast triangle counting through wedge sampling","volume":"1202","author":"Comandur S.","year":"2012","unstructured":"S. Comandur , A. Pinar , and T. Kolda , \" Fast triangle counting through wedge sampling ,\" ArXiv , vol. abs\/ 1202 . 5230 , 2012 . S. Comandur, A. Pinar, and T. Kolda, \"Fast triangle counting through wedge sampling,\" ArXiv, vol. abs\/1202.5230, 2012.","journal-title":"ArXiv"},{"key":"e_1_3_2_1_25_1","first-page":"595","volume-title":"The WebGraph framework I: Compression techniques,\" in WWW '04","author":"Boldi P.","year":"2004","unstructured":"P. Boldi and S. Vigna , \" The WebGraph framework I: Compression techniques,\" in WWW '04 , 2004 , pp. 595 -- 601 . P. Boldi and S. Vigna, \"The WebGraph framework I: Compression techniques,\" in WWW '04, 2004, pp. 595--601."},{"key":"e_1_3_2_1_26_1","first-page":"587","volume-title":"Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,\" in WWW '11","author":"Boldi P.","year":"2011","unstructured":"P. Boldi , M. Rosa , M. Santini , and S. Vigna , \" Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,\" in WWW '11 . ACM Press , 2011 , pp. 587 -- 596 . P. Boldi, M. Rosa, M. Santini, and S. Vigna, \"Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks,\" in WWW '11. ACM Press, 2011, pp. 587--596."}],"event":{"name":"ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Virtual Event Netherlands","acronym":"ASONAM '21"},"container-title":["Proceedings of the 2021 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3489471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487351.3489471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:49Z","timestamp":1750188649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487351.3489471"}},"subtitle":["the power of dual sampling"],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":26,"alternative-id":["10.1145\/3487351.3489471","10.1145\/3487351"],"URL":"https:\/\/doi.org\/10.1145\/3487351.3489471","relation":{},"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"2022-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}