{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:26:27Z","timestamp":1765974387100,"version":"3.41.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DTRA CNIMS","award":["HDTRA1-11-D-0016-0001"],"award-info":[{"award-number":["HDTRA1-11-D-0016-0001"]}]},{"name":"NSF SDCI","award":["OCI-1032677"],"award-info":[{"award-number":["OCI-1032677"]}]},{"name":"DTRA Grant","award":["HDTRA1-11-1-0016"],"award-info":[{"award-number":["HDTRA1-11-1-0016"]}]},{"name":"DTRA NSF NetSE","award":["CNS-1011769"],"award-info":[{"award-number":["CNS-1011769"]}]},{"name":"Louisiana Board of Regents RCS","award":["EQSF(2017-20)-RDA-25"],"award-info":[{"award-number":["EQSF(2017-20)-RDA-25"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2020,2,29]]},"abstract":"<jats:p>Big graphs (networks) arising in numerous application areas pose significant challengesfor graph analysts as these graphs grow to billions of nodes and edges and are prohibitively large to fit in the main memory. Finding the number of triangles in a graph is an important problem in the mining and analysis of graphs. In this article, we present two efficient MPI-based distributed memory parallel algorithms for counting triangles in big graphs. The first algorithm employs overlapping partitioning and efficient load balancing schemes to provide a very fast parallel algorithm. The algorithm scales well to networks with billions of nodes and can compute the exact number of triangles in a network with 10 billion edges in 16 minutes. The second algorithm divides the network into non-overlapping partitions leading to a space-efficient algorithm. Our results on both artificial and real-world networks demonstrate a significant space saving with this algorithm. We also present a novel approach that reduces communication cost drastically leading the algorithm to both a space- and runtime-efficient algorithm. Further, we demonstrate how our algorithms can be used to list all triangles in a graph and compute clustering coefficients of nodes. Our algorithm can also be adapted to a parallel approximation algorithm using an edge sparsification method.<\/jats:p>","DOI":"10.1145\/3365676","type":"journal-article","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T14:08:57Z","timestamp":1576246137000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Fast Parallel Algorithms for Counting and Listing Triangles in Big Graphs"],"prefix":"10.1145","volume":"14","author":[{"given":"Shaikh","family":"Arifuzzaman","sequence":"first","affiliation":[{"name":"University of New Orleans, New Orleans, LA"}]},{"given":"Maleq","family":"Khan","sequence":"additional","affiliation":[{"name":"Texas A8M University\u2013Kingsville, Kingsville, TX"}]},{"given":"Madhav","family":"Marathe","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA"}]}],"member":"320","published-online":{"date-parts":[[2019,12,13]]},"reference":[{"volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201914)","author":"Ahmed N.","key":"e_1_2_1_1_1","unstructured":"N. Ahmed , N. Duffield , J. Neville , and R. Kompella . 2014. Graph sample and hold: A framework for big-graph analytics . In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201914) . ACM N. Ahmed, N. Duffield, J. Neville, and R. Kompella. 2014. Graph sample and hold: A framework for big-graph analytics. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201914). ACM"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137651"},{"volume-title":"Proceedings of the 2016 IEEE International Conference on Big Data (Big Data\u201916)","author":"Ahmed N.","key":"e_1_2_1_3_1","unstructured":"N. Ahmed , T. Willke , and R. Rossi . 2016. Estimation of local subgraph counts . In Proceedings of the 2016 IEEE International Conference on Big Data (Big Data\u201916) . N. Ahmed, T. Willke, and R. Rossi. 2016. Estimation of local subgraph counts. In Proceedings of the 2016 IEEE International Conference on Big Data (Big Data\u201916)."},{"volume-title":"Proceedings of the IFIP Intlernational Conference on Network and Parallel Computing.","author":"Alam M.","key":"e_1_2_1_4_1","unstructured":"M. Alam and M. Khan . 2015. Parallel algorithms for generating random networks with given degree sequences . In Proceedings of the IFIP Intlernational Conference on Network and Parallel Computing. M. Alam and M. Khan. 2015. Parallel algorithms for generating random networks with given degree sequences. In Proceedings of the IFIP Intlernational Conference on Network and Parallel Computing."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of ACM\/IEEE International Conference on High Performance Computing, Networking Storage and Analysis (SC\u201912)","author":"Aluru S.","year":"2012","unstructured":"S. Aluru . 2012 . Teaching parallel computing through parallel prefix . In Proceedings of ACM\/IEEE International Conference on High Performance Computing, Networking Storage and Analysis (SC\u201912) . S. Aluru. 2012. Teaching parallel computing through parallel prefix. In Proceedings of ACM\/IEEE International Conference on High Performance Computing, Networking Storage and Analysis (SC\u201912)."},{"volume-title":"Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201916)","author":"Anderson M.","key":"e_1_2_1_7_1","unstructured":"M. Anderson , N. Sundaram , N. Satish , M. Patwary , T. Willke , and P. Dubey . 2016. GraphPad: Optimized graph primitives for parallel and distributed platforms . In Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201916) . M. Anderson, N. Sundaram, N. Satish, M. Patwary, T. Willke, and P. Dubey. 2016. GraphPad: Optimized graph primitives for parallel and distributed platforms. In Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS\u201916)."},{"volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)","author":"Arifuzzaman S.","key":"e_1_2_1_8_1","unstructured":"S. Arifuzzaman , M. Khan , and M. Marathe . 2013. PATRIC: A parallel algorithm for counting triangles in massive networks . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913) . S. Arifuzzaman, M. Khan, and M. Marathe. 2013. PATRIC: A parallel algorithm for counting triangles in massive networks. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)."},{"volume-title":"Proceedings of the IEEE International Conference on High Performance Computing and Communications (HPCC\u201915)","author":"Arifuzzaman S.","key":"e_1_2_1_9_1","unstructured":"S. Arifuzzaman , M. Khan , and M. Marathe . 2015. A space-efficient parallel algorithm for counting exact triangles in massive networks . In Proceedings of the IEEE International Conference on High Performance Computing and Communications (HPCC\u201915) . S. Arifuzzaman, M. Khan, and M. Marathe. 2015. A space-efficient parallel algorithm for counting exact triangles in massive networks. In Proceedings of the IEEE International Conference on High Performance Computing and Communications (HPCC\u201915)."},{"volume-title":"Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop (IPDPSW\u201915)","author":"Azad A.","key":"e_1_2_1_10_1","unstructured":"A. Azad , A. Bulu\u00e7 , and J. Gilbert . 2015. Parallel triangle counting and enumeration using matrix algebra . In Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop (IPDPSW\u201915) . A. Azad, A. Bulu\u00e7, and J. Gilbert. 2015. Parallel triangle counting and enumeration using matrix algebra. In Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop (IPDPSW\u201915)."},{"volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.","author":"Bar-Yosseff Z.","key":"e_1_2_1_11_1","unstructured":"Z. Bar-Yosseff , R. Kumar , and D. Sivakumar . 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. Z. Bar-Yosseff, R. Kumar, and D. Sivakumar. 2002. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"A. Barabasi and R. Albert. 1999. Emergence of scaling in random networks. Science 286 5439 (1999) 509--512.  A. Barabasi and R. Albert. 1999. Emergence of scaling in random networks. Science 286 5439 (1999) 509--512.","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1995456.1995598"},{"volume-title":"Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD\u201908)","author":"Becchetti L.","key":"e_1_2_1_14_1","unstructured":"L. Becchetti , P. Boldi , C. Castillo , and A. Gionis . 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs . In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD\u201908) . L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD\u201908)."},{"volume-title":"Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)","author":"Bisson M.","key":"e_1_2_1_15_1","unstructured":"M. Bisson and M. Fatica . 2017. Static graph challenge on GPU . In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917) . M. Bisson and M. Fatica. 2017. Static graph challenge on GPU. In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)."},{"volume-title":"Random Graphs","author":"Bollobas B.","key":"e_1_2_1_16_1","unstructured":"B. Bollobas . 2001. Random Graphs . Cambridge Univ. Press . B. Bollobas. 2001. Random Graphs. Cambridge Univ. Press."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"volume-title":"Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD).","author":"Chu S.","key":"e_1_2_1_18_1","unstructured":"S. Chu and J. Cheng . 2011. Triangle listing in massive networks and its applications . In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD). S. Chu and J. Cheng. 2011. Triangle listing in massive networks and its applications. In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"volume-title":"Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS\u201915)","author":"Eden T.","key":"e_1_2_1_21_1","unstructured":"T. Eden , A. Levi , D. Ron , and C. Seshadhri . 2015. Approximately counting triangles in sublinear time . In Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS\u201915) . IEEE Computer Society. T. Eden, A. Levi, D. Ron, and C. Seshadhri. 2015. Approximately counting triangles in sublinear time. In Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS\u201915). IEEE Computer Society."},{"volume-title":"Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201915)","author":"Elenberg E.","key":"e_1_2_1_22_1","unstructured":"E. Elenberg , K. Shanmugam , M. Borokhovich , and A. Dimakis . 2015. Beyond triangles: A distributed framework for estimating 3-profiles of large graphs . In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201915) . E. Elenberg, K. Shanmugam, M. Borokhovich, and A. Dimakis. 2015. Beyond triangles: A distributed framework for estimating 3-profiles of large graphs. In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201915)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"volume-title":"Proceedings of the 4th Workshop on Irregular Applications: Architectures and Algorithms.","author":"Green O.","key":"e_1_2_1_24_1","unstructured":"O. Green , P. Yalamanchili , and L. Mungu\u00eda . 2014. Fast triangle counting on the GPU . In Proceedings of the 4th Workshop on Irregular Applications: Architectures and Algorithms. O. Green, P. Yalamanchili, and L. Mungu\u00eda. 2014. Fast triangle counting on the GPU. In Proceedings of the 4th Workshop on Irregular Applications: Architectures and Algorithms."},{"volume-title":"Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)","author":"Hu Y.","key":"e_1_2_1_25_1","unstructured":"Y. Hu , P. Kumar , G. Swope , and H. H. Huang . 2017. TriX: Triangle counting at extreme scale . In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917) . 1--7. Y. Hu, P. Kumar, G. Swope, and H. H. Huang. 2017. TriX: Triangle counting at extreme scale. In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917). 1--7."},{"key":"e_1_2_1_26_1","article-title":"A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox","volume":"9","author":"Jha M.","year":"2015","unstructured":"M. Jha , C. Seshadhri , and A. Pinar . 2015 . A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox . ACM Transactions on Knowledge Discovery 9 , 3 (2015), Article 15. M. Jha, C. Seshadhri, and A. Pinar. 2015. A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox. ACM Transactions on Knowledge Discovery 9, 3 (2015), Article 15.","journal-title":"ACM Transactions on Knowledge Discovery"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/13090729X"},{"key":"e_1_2_1_28_1","unstructured":"H. Kwak. 2010. Twitter Data. Retrieved from http:\/\/an.kaist.ac.kr\/haewoon\/release\/twitter_social_graph.  H. Kwak. 2010. Twitter Data. Retrieved from http:\/\/an.kaist.ac.kr\/haewoon\/release\/twitter_social_graph."},{"volume-title":"Proceedings of the 19th International Conference on World Wide Web. ACM, 591--600","author":"Kwak H.","key":"e_1_2_1_29_1","unstructured":"H. Kwak , C. Lee , H. Park , and S. Moon . 2010. What is Twitter, a social network or a news media? In Proceedings of the 19th International Conference on World Wide Web. ACM, 591--600 . H. Kwak, C. Lee, H. Park, and S. Moon. 2010. What is Twitter, a social network or a news media? In Proceedings of the 19th International Conference on World Wide Web. ACM, 591--600."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_2_1_31_1","unstructured":"J. Leskovec. 2012. Stanford Network Analysis Project. Retrieved from http:\/\/snap.stanford.edu\/.  J. Leskovec. 2012. Stanford Network Analysis Project. Retrieved from http:\/\/snap.stanford.edu\/."},{"volume-title":"Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201915)","author":"Lim Y.","key":"e_1_2_1_32_1","unstructured":"Y. Lim and U. Kang . 2015. MASCOT: Memory-efficient and accurate sampling for counting local triangles in graph streams . In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201915) . Y. Lim and U. Kang. 2015. MASCOT: Memory-efficient and accurate sampling for counting local triangles in graph streams. In Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201915)."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_2_1_34_1","volume-title":"Network motifs: simple building blocks of complex networks. Science 298, 5594","author":"Milo Ron","year":"2002","unstructured":"Ron Milo , Shai Shen-Orr , Shalev Itzkovitz , Nadav Kashtan , Dmitri Chklovskii , and Uri Alon . 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 ( 2002 ), 824--827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 (2002), 824--827."},{"volume-title":"Proceedings of the Meeting on Algorithm Engineering 8 Expermiments.","author":"Ortmann M.","key":"e_1_2_1_35_1","unstructured":"M. Ortmann and U. Brandes . 2014. Triangle listing algorithms: Back from the diversion . In Proceedings of the Meeting on Algorithm Engineering 8 Expermiments. M. Ortmann and U. Brandes. 2014. Triangle listing algorithms: Back from the diversion. In Proceedings of the Meeting on Algorithm Engineering 8 Expermiments."},{"volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)","author":"Park H.","key":"e_1_2_1_36_1","unstructured":"H. Park and C. Chung . 2013. An efficient MapReduce algorithm for counting triangles in a very large graph . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913) . H. Park and C. Chung. 2013. An efficient MapReduce algorithm for counting triangles in a very large graph. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)."},{"volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201916)","author":"Park H.","key":"e_1_2_1_37_1","unstructured":"H. Park , S. Myaeng , and U. Kang . 2016. PTE: Enumerating trillion triangles on distributed systems . In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201916) . H. Park, S. Myaeng, and U. Kang. 2016. PTE: Enumerating trillion triangles on distributed systems. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201916)."},{"volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201914)","author":"Park H.","key":"e_1_2_1_38_1","unstructured":"H. Park , F. Silvestri , U. Kang , and R. Pagh . 2014. MapReduce triangle enumeration with guarantees . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201914) . H. Park, F. Silvestri, U. Kang, and R. Pagh. 2014. MapReduce triangle enumeration with guarantees. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201914)."},{"key":"e_1_2_1_39_1","unstructured":"PaToH. 2011. PaToHv3.2. Retrieved from http:\/\/bmi.osu.edu\/umit\/software.html.  PaToH. 2011. PaToHv3.2. Retrieved from http:\/\/bmi.osu.edu\/umit\/software.html."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091051"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"A. Prat-P\u00e9rez D. Dominguez-Sal J. Brunat and J. Larriba-Pey. 2016. Put three and three together: Triangle-driven community detection. ACM Transactions on Knowledge Discovery from Data 10 3 (2016) 22:1--22:42.  A. Prat-P\u00e9rez D. Dominguez-Sal J. Brunat and J. Larriba-Pey. 2016. Put three and three together: Triangle-driven community detection. ACM Transactions on Knowledge Discovery from Data 10 3 (2016) 22:1--22:42.","DOI":"10.1145\/2775108"},{"volume-title":"Proceedings of the IEEE International Conference on Big Data.","author":"Rahman M.","key":"e_1_2_1_42_1","unstructured":"M. Rahman and M. Hasan . 2013. Approximate triangle counting algorithms on multi-cores . In Proceedings of the IEEE International Conference on Big Data. M. Rahman and M. Hasan. 2013. Approximate triangle counting algorithms on multi-cores. In Proceedings of the IEEE International Conference on Big Data."},{"volume-title":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data.","author":"Satish N.","key":"e_1_2_1_43_1","unstructured":"N. Satish , N. Sundaram , M. Patwary , J. Seo , J. Park , M. Hassaan , S. Sengupta , Z. Yin , and P. Dubey . 2014. Navigating the maze of graph analytics frameworks using massive graph datasets . In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. N. Satish, N. Sundaram, M. Patwary, J. Seo, J. Park, M. Hassaan, S. Sengupta, Z. Yin, and P. Dubey. 2014. Navigating the maze of graph analytics frameworks using massive graph datasets. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data."},{"volume-title":"Proceedings of the 4th international conference on Experimental and Efficient Algorithms.","author":"Schank T.","key":"e_1_2_1_45_1","unstructured":"T. Schank and D. Wagner . 2005. Finding, counting and listing all triangles in large graphs, an experimental study . In Proceedings of the 4th international conference on Experimental and Efficient Algorithms. T. Schank and D. Wagner. 2005. Finding, counting and listing all triangles in large graphs, an experimental study. In Proceedings of the 4th international conference on Experimental and Efficient Algorithms."},{"volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE\u201915)","author":"Shun J.","key":"e_1_2_1_46_1","unstructured":"J. Shun and K. Tangwongsan . 2015. Multicore triangle computations without tuning . In Proceedings of the IEEE International Conference on Data Engineering (ICDE\u201915) . J. Shun and K. Tangwongsan. 2015. Multicore triangle computations without tuning. In Proceedings of the IEEE International Conference on Data Engineering (ICDE\u201915)."},{"volume-title":"Proceedings of the 2011 IEEE International Parallel 8 Distributed Processing Symposium (IPDPS\u201911)","author":"Soman J.","key":"e_1_2_1_47_1","unstructured":"J. Soman and A. Narang . 2011. Fast community detection algorithm with GPUs and multicore architectures . In Proceedings of the 2011 IEEE International Parallel 8 Distributed Processing Symposium (IPDPS\u201911) . 568--579. J. Soman and A. Narang. 2011. Fast community detection algorithm with GPUs and multicore architectures. In Proceedings of the 2011 IEEE International Parallel 8 Distributed Processing Symposium (IPDPS\u201911). 568--579."},{"key":"e_1_2_1_48_1","first-page":"1","article-title":"TRI\u00c8ST: Counting local and global triangles in fully dynamic streams with fixed memory size. ACM Transactions on Knowledge Discovery from Data 11, 4","volume":"43","author":"Stefani L.","year":"2017","unstructured":"L. Stefani , A. Epasto , M. Riondato , and E. Upfal . 2017 . TRI\u00c8ST: Counting local and global triangles in fully dynamic streams with fixed memory size. ACM Transactions on Knowledge Discovery from Data 11, 4 , Article 43 (2017), 1 -- 50 . L. Stefani, A. Epasto, M. Riondato, and E. Upfal. 2017. TRI\u00c8ST: Counting local and global triangles in fully dynamic streams with fixed memory size. ACM Transactions on Knowledge Discovery from Data 11, 4, Article 43 (2017), 1--50.","journal-title":"Article"},{"volume-title":"Proceedings of the International World Wide Web Conference (WWW\u201911)","author":"Suri S.","key":"e_1_2_1_49_1","unstructured":"S. Suri and S. Vassilvitskii . 2011. Counting triangles and the curse of the last reducer . In Proceedings of the International World Wide Web Conference (WWW\u201911) . S. Suri and S. Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In Proceedings of the International World Wide Web Conference (WWW\u201911)."},{"volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)","author":"Tangwongsan K.","key":"e_1_2_1_50_1","unstructured":"K. Tangwongsan , A. Pavan , and S. Tirthapura . 2013. Parallel triangle counting in massive streaming graphs . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913) . K. Tangwongsan, A. Pavan, and S. Tirthapura. 2013. Parallel triangle counting in massive streaming graphs. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)."},{"volume-title":"Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)","author":"Tom A. S.","key":"e_1_2_1_51_1","unstructured":"A. S. Tom , N. Sundaram , N. Ahmed , S. Smith , S. Eyerman , M. Kodiyath , I. Hur , F. Petrini , and G. Karypis . 2017. Exploring optimizations on shared-memory platforms for parallel triangle counting algorithms . In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917) . 1--7. A. S. Tom, N. Sundaram, N. Ahmed, S. Smith, S. Eyerman, M. Kodiyath, I. Hur, F. Petrini, and G. Karypis. 2017. Exploring optimizations on shared-memory platforms for parallel triangle counting algorithms. In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917). 1--7."},{"volume-title":"Proceedings of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (KDD\u201909)","author":"Tsourakakis C.","key":"e_1_2_1_52_1","unstructured":"C. Tsourakakis , U. Kang , G. Miller , and C. Faloutsos . 2009. DOULION: Counting triangles in massive graphs with a coin . In Proceedings of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (KDD\u201909) . C. Tsourakakis, U. Kang, G. Miller, and C. Faloutsos. 2009. DOULION: Counting triangles in massive graphs with a coin. In Proceedings of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining (KDD\u201909)."},{"key":"e_1_2_1_53_1","unstructured":"J. Ugander B. Karrer L. Backstrom and C. Marlow. 2011. The anatomy of the Facebook social graph. arXiv:1111.4503v1.  J. Ugander B. Karrer L. Backstrom and C. Marlow. 2011. The anatomy of the Facebook social graph. arXiv:1111.4503v1."},{"volume-title":"Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)","author":"Voegele C.","key":"e_1_2_1_54_1","unstructured":"C. Voegele , Y. Lu , Pai. S., and K. Pingali . 2017. Parallel triangle counting and k-truss identification using graph-centric methods . In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917) . C. Voegele, Y. Lu, Pai. S., and K. Pingali. 2017. Parallel triangle counting and k-truss identification using graph-centric methods. In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)."},{"volume-title":"Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)","author":"Wolf M.","key":"e_1_2_1_55_1","unstructured":"M. Wolf , M. Deveci , J. Berry , S. Hammond , and S. Rajamanickam . 2017. Fast linear algebra-based triangle counting with Kokkos Kernels . In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917) . M. Wolf, M. Deveci, J. Berry, S. Hammond, and S. Rajamanickam. 2017. Fast linear algebra-based triangle counting with Kokkos Kernels. In Proceedings of the 2017 IEEE High Performance Extreme Computing Conference (HPEC\u201917)."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2556663"},{"volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909)","author":"Zhang Y.","key":"e_1_2_1_57_1","unstructured":"Y. Zhang , J. Wang , Y. Wang , and L. Zhou . 2009. Parallel community detection on large networks with propinquity dynamics . In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909) . 997--1006. Y. Zhang, J. Wang, Y. Wang, and L. Zhou. 2009. Parallel community detection on large networks with propinquity dynamics. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201909). 997--1006."},{"key":"e_1_2_1_58_1","unstructured":"Zoltan. 2013. Zoltan Graph Partitioning. Retrieved from http:\/\/www.cs.sandia.gov\/zoltan\/.  Zoltan. 2013. Zoltan Graph Partitioning. Retrieved from http:\/\/www.cs.sandia.gov\/zoltan\/."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3365676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3365676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:36Z","timestamp":1750202616000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3365676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,13]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,29]]}},"alternative-id":["10.1145\/3365676"],"URL":"https:\/\/doi.org\/10.1145\/3365676","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2019,12,13]]},"assertion":[{"value":"2016-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}