{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T10:24:49Z","timestamp":1773051889236,"version":"3.50.1"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,2,9]],"date-time":"2020-02-09T00:00:00Z","timestamp":1581206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Artificial Intelligence Graduate School Program"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1314632 and IIS-1408924"],"award-info":[{"award-number":["CNS-1314632 and IIS-1408924"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea government MSIT","award":["NRF-2019R1F1A1059755 and 2019-0-00075-001"],"award-info":[{"award-number":["NRF-2019R1F1A1059755 and 2019-0-00075-001"]}]},{"name":"Institute of Information 8 Communications Technology Planning 8 Evaluation"},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"crossref","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2020,4,30]]},"abstract":"<jats:p>Given a stream of edge additions and deletions, how can we estimate the count of triangles in it? If we can store only a subset of the edges, how can we obtain unbiased estimates with small variances?<\/jats:p>\n          <jats:p>Counting triangles (i.e., cliques of size three) in a graph is a classical problem with applications in a wide range of research areas, including social network analysis, data mining, and databases. Recently, streaming algorithms for triangle counting have been extensively studied since they can naturally be used for large dynamic graphs. However, existing algorithms cannot handle edge deletions or suffer from low accuracy.<\/jats:p>\n          <jats:p>\n            Can we handle edge deletions while achieving high accuracy? We propose T\n            <jats:sc>hink<\/jats:sc>\n            D, which accurately estimates the counts of global triangles (i.e., all triangles) and local triangles associated with each node in a fully dynamic graph stream with additions and deletions of edges. Compared to its best competitors, T\n            <jats:sc>hink<\/jats:sc>\n            D is\n            <jats:bold>(a) Accurate:<\/jats:bold>\n            up to\n            <jats:italic>4.3<\/jats:italic>\n            \u00d7\n            <jats:italic>more accurate<\/jats:italic>\n            within the same memory budget,\n            <jats:bold>(b) Fast:<\/jats:bold>\n            up to\n            <jats:italic>2.2<\/jats:italic>\n            \u00d7\n            <jats:italic>faster<\/jats:italic>\n            for the same accuracy requirements, and\n            <jats:bold>(c) Theoretically sound:<\/jats:bold>\n            always maintaining estimates with zero bias (i.e., the difference between the true triangle count and the expected value of its estimate) and small variance. As an application, we use T\n            <jats:sc>hink<\/jats:sc>\n            D to detect suddenly emerging dense subgraphs, and we show its advantages over state-of-the-art methods.\n          <\/jats:p>","DOI":"10.1145\/3375392","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T06:49:13Z","timestamp":1581317353000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2872-1526","authenticated-orcid":false,"given":"Kijung","family":"Shin","sequence":"first","affiliation":[{"name":"KAIST, Daejeon, Republic of Korea"}]},{"given":"Sejoon","family":"Oh","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}]},{"given":"Jisu","family":"Kim","sequence":"additional","affiliation":[{"name":"Inria Saclay, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5645-1754","authenticated-orcid":false,"given":"Bryan","family":"Hooi","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Republic of Singapore"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2020,2,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Nesreen K. Ahmed Nick Duffield Jennifer Neville and Ramana Kompella. 2014. Graph sample and hold: A framework for big-graph analytics. In KDD\u201914.  Nesreen K. Ahmed Nick Duffield Jennifer Neville and Ramana Kompella. 2014. Graph sample and hold: A framework for big-graph analytics. In KDD\u201914.","DOI":"10.1145\/2623330.2623757"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137651"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Reid Andersen and Kumar Chellapilla. 2009. Finding dense subgraphs with size bounds. In WAW\u201909.  Reid Andersen and Kumar Chellapilla. 2009. Finding dense subgraphs with size bounds. In WAW\u201909.","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_2_1_4_1","unstructured":"Brian Babcock Mayur Datar and Rajeev Motwani. 2002. Sampling from a moving window over streaming data. In SODA\u201902.  Brian Babcock Mayur Datar and Rajeev Motwani. 2002. Sampling from a moving window over streaming data. In SODA\u201902."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_2_1_6_1","unstructured":"Ziv Bar-Yossef Ravi Kumar and D. Sivakumar. 2002. Reductions in streaming algorithms with an application to counting triangles in graphs. In SODA\u201902.  Ziv Bar-Yossef Ravi Kumar and D. Sivakumar. 2002. Reductions in streaming algorithms with an application to counting triangles in graphs. In SODA\u201902."},{"key":"e_1_2_1_7_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."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.09.051"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1839490.1839494"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Sayan Bhattacharya Monika Henzinger Danupon Nanongkai and Charalampos Tsourakakis. 2015. Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In STOC\u201915.  Sayan Bhattacharya Monika Henzinger Danupon Nanongkai and Charalampos Tsourakakis. 2015. Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In STOC\u201915.","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_2_1_13_1","volume-title":"Haas","author":"Brown Paul G.","year":"2006","unstructured":"Paul G. Brown and Peter J . Haas . 2006 . Techniques for warehousing of sample data. In ICDE\u2019 06. Paul G. Brown and Peter J. Haas. 2006. Techniques for warehousing of sample data. In ICDE\u201906."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In APPROX\u201900.  Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In APPROX\u201900.","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382577.2382581"},{"key":"e_1_2_1_16_1","volume-title":"ESA\u201913","author":"Crouch Michael S.","unstructured":"Michael S. Crouch , Andrew McGregor , and Daniel Stubbs . 2013. Dynamic graphs in the sliding-window model . In ESA\u201913 . Springer , 337--348. Michael S. Crouch, Andrew McGregor, and Daniel Stubbs. 2013. Dynamic graphs in the sliding-window model. In ESA\u201913. Springer, 337--348."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3059194"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856327"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Alessandro Epasto Silvio Lattanzi and Mauro Sozio. 2015a. Efficient densest subgraph computation in evolving graphs. In WWW\u201915.  Alessandro Epasto Silvio Lattanzi and Mauro Sozio. 2015a. Efficient densest subgraph computation in evolving graphs. In WWW\u201915.","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0065-y"},{"key":"e_1_2_1_22_1","unstructured":"David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In VLDB\u201905.  David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In VLDB\u201905."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Guyue Han and Harish Sethu. 2017. Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs. In ASONAM\u201917.  Guyue Han and Harish Sethu. 2017. Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs. In ASONAM\u201917.","DOI":"10.1145\/3110025.3110061"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1177\/104649647100200201"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3056563"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2691190.2691193"},{"key":"e_1_2_1_29_1","unstructured":"Madhav Jha Comandur Seshadhri and Ali Pinar. 2013. A space efficient streaming algorithm for triangle counting using the birthday paradox. In KDD\u201913.  Madhav Jha Comandur Seshadhri and Ali Pinar. 2013. A space efficient streaming algorithm for triangle counting using the birthday paradox. In KDD\u201913."},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Meng Jiang Alex Beutel Peng Cui Bryan Hooi Shiqiang Yang and Christos Faloutsos. 2015. A general suspiciousness metric for dense blocks in multimodal data. In ICDM\u201915.  Meng Jiang Alex Beutel Peng Cui Bryan Hooi Shiqiang Yang and Christos Faloutsos. 2015. A general suspiciousness metric for dense blocks in multimodal data. In ICDM\u201915.","DOI":"10.1109\/ICDM.2015.61"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623632"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-019-00630-6"},{"key":"e_1_2_1_33_1","volume-title":"Valuation of Network Effects in Software Markets: A Complex Networks Approach","author":"Kemper Andreas","unstructured":"Andreas Kemper . 2009. Valuation of Network Effects in Software Markets: A Complex Networks Approach . Springer Science 8 Business Media. Andreas Kemper. 2009. Valuation of Network Effects in Software Markets: A Complex Networks Approach. Springer Science 8 Business Media."},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In ICALP\u201909. 597--608.  Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In ICALP\u201909. 597--608.","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_2_1_35_1","unstructured":"Bryan Klimt and Yiming Yang. 2004. Introducing the enron corpus. In CEAS\u201904.  Bryan Klimt and Yiming Yang. 2004. Introducing the enron corpus. In CEAS\u201904."},{"key":"e_1_2_1_36_1","volume-title":"Tsourakakis","author":"Kolountzakis Mihail N.","year":"2010","unstructured":"Mihail N. Kolountzakis , Gary L. Miller , Richard Peng , and Charalampos E . Tsourakakis . 2010 . Efficient triangle counting in large graphs via degree-based vertex partitioning. In WAW\u2019 10. Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, and Charalampos E. Tsourakakis. 2010. Efficient triangle counting in large graphs via degree-based vertex partitioning. In WAW\u201910."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Konstantin Kutzkov and Rasmus Pagh. 2014. Triangle counting in dynamic graph streams. In SWAT\u201914.  Konstantin Kutzkov and Rasmus Pagh. 2014. Triangle counting in dynamic graph streams. In SWAT\u201914.","DOI":"10.1007\/978-3-319-08404-6_27"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Victor E. Lee Ning Ruan Ruoming Jin and Charu Aggarwal. 2010. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. 303--336.  Victor E. Lee Ning Ruan Ruoming Jin and Charu Aggarwal. 2010. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. 303--336.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_2_1_40_1","volume-title":"SPIRE\u201902","author":"Ley Michael","unstructured":"Michael Ley . 2002. The DBLP computer science bibliography: Evolution, research issues, perspectives . In SPIRE\u201902 . Springer , 1--10. Michael Ley. 2002. The DBLP computer science bibliography: Evolution, research issues, perspectives. In SPIRE\u201902. Springer, 1--10."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3022186"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289146"},{"key":"e_1_2_1_43_1","volume-title":"Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis. In ASONAM\u201911.","author":"Maruhashi Koji","year":"2011","unstructured":"Koji Maruhashi , Fan Guo , and Christos Faloutsos . 2011 . Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis. In ASONAM\u201911. Koji Maruhashi, Fan Guo, and Christos Faloutsos. 2011. Multiaspectforensics: Pattern mining on large-scale heterogeneous networks with tensor analysis. In ASONAM\u201911."},{"key":"e_1_2_1_44_1","unstructured":"Paolo Massa and Paolo Avesani. 2005. Controversial users demand local trust metrics: An experimental study on epinions. com community. In AAAI\u201905.  Paolo Massa and Paolo Avesani. 2005. Controversial users demand local trust metrics: An experimental study on epinions. com community. In AAAI\u201905."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Andrew McGregor David Tench Sofya Vorotnikova and Hoa T Vu. 2015. Densest subgraph in dynamic graph streams. In MFCS\u201914.  Andrew McGregor David Tench Sofya Vorotnikova and Hoa T Vu. 2015. Densest subgraph in dynamic graph streams. In MFCS\u201914.","DOI":"10.1007\/978-3-662-48054-0_39"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Alan Mislove Massimiliano Marcon Krishna P. Gummadi Peter Druschel and Bobby Bhattacharjee. 2007. Measurement and analysis of online social networks. In IMC\u201907.  Alan Mislove Massimiliano Marcon Krishna P. Gummadi Peter Druschel and Bobby Bhattacharjee. 2007. Measurement and analysis of online social networks. In IMC\u201907.","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_2_1_48_1","volume-title":"Gianmarco De Francisci Morales, and Sarunas Girdzijauskas","author":"Uddin Nasir Muhammad Anis","year":"2017","unstructured":"Muhammad Anis Uddin Nasir , Aristides Gionis , Gianmarco De Francisci Morales, and Sarunas Girdzijauskas . 2017 . Fully dynamic algorithm for top-k densest subgraphs. In CIKM\u2019 17. Muhammad Anis Uddin Nasir, Aristides Gionis, Gianmarco De Francisci Morales, and Sarunas Girdzijauskas. 2017. Fully dynamic algorithm for top-k densest subgraphs. In CIKM\u201917."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_2_1_52_1","volume-title":"Eigenspokes: Surprising patterns and community structure in large graphs. In PAKDD\u201910.","author":"Prakash B. A.","year":"2010","unstructured":"B. A. Prakash , M. Seshadri , A. Sridharan , S. Machiraju , and C. Faloutsos . 2010 . Eigenspokes: Surprising patterns and community structure in large graphs. In PAKDD\u201910. B. A. Prakash, M. Seshadri, A. Sridharan, S. Machiraju, and C. Faloutsos. 2010. Eigenspokes: Surprising patterns and community structure in large graphs. In PAKDD\u201910."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3046791"},{"key":"e_1_2_1_54_1","volume-title":"WRS: Waiting room sampling for accurate triangle counting in real graph streams. In ICDM\u201917.","author":"Shin Kijung","year":"2017","unstructured":"Kijung Shin . 2017 . WRS: Waiting room sampling for accurate triangle counting in real graph streams. In ICDM\u201917. Kijung Shin. 2017. WRS: Waiting room sampling for accurate triangle counting in real graph streams. In ICDM\u201917."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1077-6"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Mohammad Hammoud Euiwoong Lee Jinoh Oh and Christos Faloutsos. 2018b. Tri-Fly: Distributed estimation of global and local triangle counts in graph streams. In PAKDD\u201918.  Kijung Shin Mohammad Hammoud Euiwoong Lee Jinoh Oh and Christos Faloutsos. 2018b. Tri-Fly: Distributed estimation of global and local triangle counts in graph streams. In PAKDD\u201918.","DOI":"10.1007\/978-3-319-93040-4_51"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154414"},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Bryan Hooi Jisu Kim and Christos Faloutsos. 2017a. D-Cube: Dense-block detection in terabyte-scale tensors. In WSDM\u201917.  Kijung Shin Bryan Hooi Jisu Kim and Christos Faloutsos. 2017a. D-Cube: Dense-block detection in terabyte-scale tensors. In WSDM\u201917.","DOI":"10.1145\/3018661.3018676"},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Bryan Hooi Jisu Kim and Christos Faloutsos. 2017b. DenseAlert: Incremental dense-subtensor detection in tensor streams. In KDD\u201917. ACM 1057--1066.  Kijung Shin Bryan Hooi Jisu Kim and Christos Faloutsos. 2017b. DenseAlert: Incremental dense-subtensor detection in tensor streams. In KDD\u201917. ACM 1057--1066.","DOI":"10.1145\/3097983.3098087"},{"key":"e_1_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Kijung Shin Jisu Kim Bryan Hooi and Christos Faloutsos. 2018d. Think before you discard: Accurate triangle counting in graph streams with deletions. In ECML\/PKDD\u201918.  Kijung Shin Jisu Kim Bryan Hooi and Christos Faloutsos. 2018d. Think before you discard: Accurate triangle counting in graph streams with deletions. In ECML\/PKDD\u201918.","DOI":"10.1007\/978-3-030-10928-8_9"},{"key":"e_1_2_1_61_1","first-page":"72","article-title":"The proof and measurement of association between two things","volume":"15","author":"Spearman Charles","year":"1904","unstructured":"Charles Spearman . 1904 . The proof and measurement of association between two things . AJP 15 , 1 (1904), 72 -- 101 . Charles Spearman. 1904. The proof and measurement of association between two things. AJP 15, 1 (1904), 72--101.","journal-title":"AJP"},{"key":"e_1_2_1_62_1","volume-title":"ICDMW\u201916","author":"Sun Jun","unstructured":"Jun Sun , J\u00e9r\u00f4me Kunegis , and Steffen Staab . 2016. Predicting user roles in social networks using transfer learning with feature transformation . In ICDMW\u201916 . IEEE , 128--135. Jun Sun, J\u00e9r\u00f4me Kunegis, and Steffen Staab. 2016. Predicting user roles in social networks using transfer learning with feature transformation. In ICDMW\u201916. IEEE, 128--135."},{"key":"e_1_2_1_63_1","unstructured":"Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW\u201911.  Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW\u201911."},{"key":"e_1_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Kanat Tangwongsan Aduri Pavan and Srikanta Tirthapura. 2013. Parallel triangle counting in massive streaming graphs. In CIKM\u201913.  Kanat Tangwongsan Aduri Pavan and Srikanta Tirthapura. 2013. Parallel triangle counting in massive streaming graphs. In CIKM\u201913.","DOI":"10.1145\/2505515.2505741"},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Charalampos E Tsourakakis. 2008. Fast counting of triangles in large real networks without counting: Algorithms and laws. In ICDM\u201908.  Charalampos E Tsourakakis. 2008. Fast counting of triangles in large real networks without counting: Algorithms and laws. In ICDM\u201908.","DOI":"10.1109\/ICDM.2008.72"},{"key":"e_1_2_1_66_1","first-page":"75","article-title":"Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation","volume":"1","author":"Tsourakakis Charalampos E.","year":"2011","unstructured":"Charalampos E. Tsourakakis , Petros Drineas , Eirinaios Michelakis , Ioannis Koutis , and Christos Faloutsos . 2011 . Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation . SNAM 1 , 2 (2011), 75 -- 81 . Charalampos E. Tsourakakis, Petros Drineas, Eirinaios Michelakis, Ioannis Koutis, and Christos Faloutsos. 2011. Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation. SNAM 1, 2 (2011), 75--81.","journal-title":"SNAM"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_2_1_68_1","volume-title":"Gummadi","author":"Viswanath Bimal","year":"2009","unstructured":"Bimal Viswanath , Alan Mislove , Meeyoung Cha , and Krishna P . Gummadi . 2009 . On the evolution of user interaction in facebook. In WOSN\u2019 09. Bimal Viswanath, Alan Mislove, Meeyoung Cha, and Krishna P. Gummadi. 2009. On the evolution of user interaction in facebook. In WOSN\u201909."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149197"},{"key":"e_1_2_1_71_1","volume-title":"Social Network Analysis: Methods and Applications","author":"Wasserman Stanley","unstructured":"Stanley Wasserman and Katherine Faust . 1994. Social Network Analysis: Methods and Applications . Vol. 8 . Cambridge University Press . Stanley Wasserman and Katherine Faust. 1994. Social Network Analysis: Methods and Applications. Vol. 8. Cambridge University Press."},{"key":"e_1_2_1_72_1","volume-title":"Strogatz","author":"Watts Duncan J.","year":"1998","unstructured":"Duncan J. Watts and Steven H . Strogatz . 1998 . Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 6684 (1998), 440--442. Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 6684 (1998), 440--442."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375392","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3375392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:48Z","timestamp":1750199568000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3375392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,9]]},"references-count":71,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,4,30]]}},"alternative-id":["10.1145\/3375392"],"URL":"https:\/\/doi.org\/10.1145\/3375392","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,9]]},"assertion":[{"value":"2018-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}