{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T19:16:15Z","timestamp":1790622975867,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1910294"],"award-info":[{"award-number":["W911NF1910294"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["DMS-2023495,CCF-1740850,CCF-1813165,CCF-1909790"],"award-info":[{"award-number":["DMS-2023495,CCF-1740850,CCF-1813165,CCF-1909790"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467374","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T02:12:09Z","timestamp":1628734329000},"page":"1319-1328","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Faster and Generalized Temporal Triangle Counting, via Degeneracy Ordering"],"prefix":"10.1145","author":[{"given":"Noujan","family":"Pashanasangi","sequence":"first","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"University of California, Santa Cruz, Santa Cruz, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"https:\/\/github.com\/nojanp\/temporal-triangle-counting","author":"DOTTT.","year":"2021","unstructured":"DOTTT. https:\/\/github.com\/nojanp\/temporal-triangle-counting , 2021 . DOTTT. https:\/\/github.com\/nojanp\/temporal-triangle-counting, 2021."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1226"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 11th Conference on Innovations in Theoretical Computer Science","author":"Bera S. K.","year":"2020","unstructured":"Bera , S. K. , Pashanasangi , N. , and Seshadhri , C . Linear time subgraph counting, graph degeneracy, and the chasm at size six . In Proc. 11th Conference on Innovations in Theoretical Computer Science ( 2020 ), Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Bera, S. K., Pashanasangi, N., and Seshadhri, C. Linear time subgraph counting, graph degeneracy, and the chasm at size six. In Proc. 11th Conference on Innovations in Theoretical Computer Science (2020), Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0068-z"},{"key":"e_1_3_2_1_7_1","volume-title":"Improving graph neural network expressivity via subgraph isomorphism counting. arXiv preprint arXiv:2006.09252","author":"Bouritsas G.","year":"2020","unstructured":"Bouritsas , G. , Frasca , F. , Zafeiriou , S. , and Bronstein , M. M . Improving graph neural network expressivity via subgraph isomorphism counting. arXiv preprint arXiv:2006.09252 ( 2020 ). Bouritsas, G., Frasca, F., Zafeiriou, S., and Bronstein, M. M. Improving graph neural network expressivity via subgraph isomorphism counting. arXiv preprint arXiv:2006.09252 (2020)."},{"key":"e_1_3_2_1_8_1","series-title":"SIAM Journal on computing 14, 1","volume-title":"Arboricity and subgraph listing algorithms","author":"Chiba N.","year":"1985","unstructured":"Chiba , N. , and Nishizeki , T . Arboricity and subgraph listing algorithms . SIAM Journal on computing 14, 1 ( 1985 ), 210--223. Chiba, N., and Nishizeki, T. Arboricity and subgraph listing algorithms. SIAM Journal on computing 14, 1 (1985), 210--223."},{"key":"e_1_3_2_1_9_1","volume-title":"Tracking brain dynamics via time-dependent network analysis. Journal of neuroscience methods 193, 1","author":"Dimitriadis S. I.","year":"2010","unstructured":"Dimitriadis , S. I. , Laskaris , N. A. , Tsirka , V. , Vourkas , M. , Micheloyannis , S. , and Fotopoulos , S . Tracking brain dynamics via time-dependent network analysis. Journal of neuroscience methods 193, 1 ( 2010 ), 145--155. Dimitriadis, S. I., Laskaris, N. A., Tsirka, V., Vourkas, M., Micheloyannis, S., and Fotopoulos, S. Tracking brain dynamics via time-dependent network analysis. Journal of neuroscience methods 193, 1 (2010), 145--155."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054389"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186236"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-016-0396-z"},{"key":"e_1_3_2_1_13_1","volume-title":"From homogeneous to heterogeneous network alignment via colored graphlets. Scientific reports 8, 1","author":"Gu S.","year":"2018","unstructured":"Gu , S. , Johnson , J. , Faisal , F. E. , and Milenkovi\u0107 , T . From homogeneous to heterogeneous network alignment via colored graphlets. Scientific reports 8, 1 ( 2018 ), 1--16. Gu, S., Johnson, J., Faisal, F. E., and Milenkovi\u0107, T. From homogeneous to heterogeneous network alignment via colored graphlets. Scientific reports 8, 1 (2018), 1--16."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737791"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_1_16_1","first-page":"441","volume-title":"Proc. 26th Proceedings, International World Wide Web Conference (WWW) (2017), International World Wide Web Conferences Steering Committee","author":"Jain S.","unstructured":"Jain , S. , and Seshadhri , C . A fast and provable method for estimating clique counts using tur\u00e1n's theorem . In Proc. 26th Proceedings, International World Wide Web Conference (WWW) (2017), International World Wide Web Conferences Steering Committee , pp. 441 -- 449 . Jain, S., and Seshadhri, C. A fast and provable method for estimating clique counts using tur\u00e1n's theorem. In Proc. 26th Proceedings, International World Wide Web Conference (WWW) (2017), International World Wide Web Conferences Steering Committee, pp. 441--449."},{"key":"e_1_3_2_1_17_1","first-page":"495","volume-title":"Proc. 24th Proceedings, International World Wide Web Conference (WWW) (2015), International World Wide Web Conferences Steering Committee","author":"Jha M.","unstructured":"Jha , M. , Seshadhri , C. , and Pinar , A . Path sampling: A fast and provable method for estimating 4-vertex subgraph counts . In Proc. 24th Proceedings, International World Wide Web Conference (WWW) (2015), International World Wide Web Conferences Steering Committee , pp. 495 -- 505 . Jha, M., Seshadhri, C., and Pinar, A. Path sampling: A fast and provable method for estimating 4-vertex subgraph counts. In Proc. 24th Proceedings, International World Wide Web Conference (WWW) (2015), International World Wide Web Conferences Steering Committee, pp. 495--505."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989418"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/12\/125003"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/11\/P11005"},{"key":"e_1_3_2_1_21_1","first-page":"1343","volume-title":"Proc. Int. Conf. on World Wide Web Companion","author":"Kunegis J.","year":"2013","unstructured":"Kunegis , J. KONECT -- The Koblenz Network Collection . In Proc. Int. Conf. on World Wide Web Companion ( 2013 ), pp. 1343 -- 1350 . Kunegis, J. KONECT -- The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion (2013), pp. 1343--1350."},{"key":"e_1_3_2_1_22_1","volume-title":"Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical computer science 407, 1--3","author":"Latapy M.","year":"2008","unstructured":"Latapy , M. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical computer science 407, 1--3 ( 2008 ), 458--473. Latapy, M. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical computer science 407, 1--3 (2008), 458--473."},{"key":"e_1_3_2_1_23_1","unstructured":"Leskovec J. and Krevl A. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  Leskovec J. and Krevl A. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_24_1","volume-title":"MLG Workshop@ KDD","author":"Li Y.","year":"2018","unstructured":"Li , Y. , Lou , Z. , Shi , Y. , and Han , J . Temporal motifs in heterogeneous information networks . In MLG Workshop@ KDD ( 2018 ). Li, Y., Lou, Z., Shi, Y., and Han, J. Temporal motifs in heterogeneous information networks. In MLG Workshop@ KDD (2018)."},{"key":"e_1_3_2_1_25_1","volume-title":"A sampling framework for counting temporal motifs. arXiv preprint arXiv:1810.00980","author":"Liu P.","year":"2018","unstructured":"Liu , P. , Benson , A. , and Charikar , M . A sampling framework for counting temporal motifs. arXiv preprint arXiv:1810.00980 ( 2018 ). Liu, P., Benson, A., and Charikar, M. A sampling framework for counting temporal motifs. arXiv preprint arXiv:1810.00980 (2018)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3077495"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622100"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96193-4_3"},{"key":"e_1_3_2_1_31_1","volume-title":"Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science 2, 1","author":"Ortmann M.","year":"2017","unstructured":"Ortmann , M. , and Brandes , U . Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science 2, 1 ( 2017 ). Ortmann, M., and Brandes, U. Efficient orbit-aware triad and quad census in directed and undirected graphs. Applied network science 2, 1 (2017)."},{"key":"e_1_3_2_1_32_1","volume-title":"Uncovering the overlapping community structure of complex networks in nature and society. nature 435, 7043","author":"Palla G.","year":"2005","unstructured":"Palla , G. , Der\u00e9nyi , I. , Farkas , I. , and Vicsek , T . Uncovering the overlapping community structure of complex networks in nature and society. nature 435, 7043 ( 2005 ), 814--818. Palla, G., Der\u00e9nyi, I., Farkas, I., and Vicsek, T. Uncovering the overlapping community structure of complex networks in nature and society. nature 435, 7043 (2005), 814--818."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371773"},{"key":"e_1_3_2_1_35_1","volume-title":"Counting causal paths in big times series data on networks. arXiv preprint arXiv:1905.11287","author":"Petrovic L. V.","year":"2019","unstructured":"Petrovic , L. V. , and Scholtes , I . Counting causal paths in big times series data on networks. arXiv preprint arXiv:1905.11287 ( 2019 ). Petrovic, L. V., and Scholtes, I. Counting causal paths in big times series data on networks. arXiv preprint arXiv:1905.11287 (2019)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom-PASSAT.2012.130"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567993"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492586"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4139-7_10"},{"key":"e_1_3_2_1_41_1","first-page":"107","volume-title":"Discovering colored network motifs","author":"Ribeiro P.","year":"2014","unstructured":"Ribeiro , P. , and Silva , F . Discovering colored network motifs . In Complex Networks V. Springer , 2014 , pp. 107 -- 118 . Ribeiro, P., and Silva, F. Discovering colored network motifs. In Complex Networks V. Springer, 2014, pp. 107--118."},{"key":"e_1_3_2_1_42_1","volume-title":"Heterogeneous network motifs. arXiv preprint arXiv:1901.10026","author":"Rossi R. A.","year":"2019","unstructured":"Rossi , R. A. , Ahmed , N. K. , Carranza , A. , Arbour , D. , Rao , A. , Kim , S. , and Koh , E . Heterogeneous network motifs. arXiv preprint arXiv:1901.10026 ( 2019 ). Rossi, R. A., Ahmed, N. K., Carranza, A., Arbour, D., Rao, A., Kim, S., and Koh, E. Heterogeneous network motifs. arXiv preprint arXiv:1901.10026 (2019)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.2"},{"key":"e_1_3_2_1_44_1","first-page":"75","volume-title":"Proceedings of the Web Conference (WWW)","volume":"2","author":"Seshadhri C.","year":"2019","unstructured":"Seshadhri , C. , and Tirthapura , S . Scalable subgraph counting: The methods behind the madness: Www 2019 tutorial . In Proceedings of the Web Conference (WWW) ( 2019 ), vol. 2 , p. 75 . Seshadhri, C., and Tirthapura, S. Scalable subgraph counting: The methods behind the madness: Www 2019 tutorial. In Proceedings of the Web Conference (WWW) (2019), vol. 2, p. 75."},{"key":"e_1_3_2_1_45_1","first-page":"7","article-title":"Tm-miner: Tfs-based algorithm for mining temporal motifs in large temporal network","author":"Sun X.","year":"2019","unstructured":"Sun , X. , Tan , Y. , Wu , Q. , Chen , B. , and Shen , C . Tm-miner: Tfs-based algorithm for mining temporal motifs in large temporal network . IEEE Access 7 ( 2019 ). Sun, X., Tan, Y., Wu, Q., Chen, B., and Shen, C. Tm-miner: Tfs-based algorithm for mining temporal motifs in large temporal network. IEEE Access 7 (2019).","journal-title":"IEEE Access"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.3390\/sym11101188"},{"key":"e_1_3_2_1_47_1","volume-title":"Network classification in temporal networks using motifs. arXiv preprint arXiv:1807.03733","author":"Tu K.","year":"2018","unstructured":"Tu , K. , Li , J. , Towsley , D. , Braines , D. , and Turner , L. D . Network classification in temporal networks using motifs. arXiv preprint arXiv:1807.03733 ( 2018 ). Tu, K., Li, J., Towsley, D., Braines, D., and Turner, L. D. Network classification in temporal networks using motifs. arXiv preprint arXiv:1807.03733 (2018)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3342908"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313534"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.026107"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0406024101"},{"key":"e_1_3_2_1_52_1","volume-title":"Foundations of temporal text networks. Applied network science 3, 1","author":"Vega D.","year":"2018","unstructured":"Vega , D. , and Magnani , M . Foundations of temporal text networks. Applied network science 3, 1 ( 2018 ), 1--26. Vega, D., and Magnani, M. Foundations of temporal text networks. Applied network science 3, 1 (2018), 1--26."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411862"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_3_2_1_55_1","volume-title":"Collective dynamics of ?small-world'networks. nature 393, 6684","author":"Watts D. J.","year":"1998","unstructured":"Watts , D. J. , and Strogatz , S. H . Collective dynamics of ?small-world'networks. nature 393, 6684 ( 1998 ), 440--442. Watts, D. J., and Strogatz, S. H. Collective dynamics of ?small-world'networks. nature 393, 6684 (1998), 440--442."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"e_1_3_2_1_57_1","volume-title":"Revealing the hidden language of complex networks. Scientific reports 4, 1","author":"Yaveroug","year":"2014","unstructured":"Yaveroug lu, \u00d6. N., Malod-Dognin , N. , Davis , D. , Levnajic , Z. , Janjic , V. , Karapandza , R. , Stojmirovic , A. , and Prvz ulj, N. Revealing the hidden language of complex networks. Scientific reports 4, 1 ( 2014 ), 1--9. Yaveroug lu, \u00d6. N., Malod-Dognin, N., Davis, D., Levnajic, Z., Janjic, V., Karapandza, R., Stojmirovic, A., and Prvz ulj, N. Revealing the hidden language of complex networks. Scientific reports 4, 1 (2014), 1--9."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v8i1.14507"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467374","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3447548.3467374","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467374","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467374","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:18:23Z","timestamp":1750177103000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":58,"alternative-id":["10.1145\/3447548.3467374","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467374","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}