{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:16:51Z","timestamp":1767921411215,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"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":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512167","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:13:07Z","timestamp":1650863587000},"page":"1191-1202","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Lightning Fast and Space Efficient k-clique Counting"],"prefix":"10.1145","author":[{"given":"Xiaowei","family":"Ye","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, China"}]},{"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, China"}]},{"given":"Qiangqiang","family":"Dai","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, China"}]},{"given":"Hongzhi","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance, China"}]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mohammad Almasri Izzat\u00a0El Hajj Rakesh Nagi Jinjun Xiong and Wen-Mei\u00a0W. Hwu. 2021. K-Clique Counting on GPUs. CoRR abs\/2104.13209(2021).","DOI":"10.1145\/3524059.3532382"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Noga Alon Raphael Yuster and Uri Zwick. 1994. Color-coding: a new method for finding simple paths cycles and other small subgraphs within large graphs. In STOC.","DOI":"10.1145\/195058.195179"},{"key":"e_1_3_2_1_3_1","volume-title":"Handbook of Optimization in Telecommunications","author":"Balasundaram Balabhaskar","unstructured":"Balabhaskar Balasundaram and Sergiy Butenko. 2006. Graph Domination, Coloring and Cliques in Telecommunications. In Handbook of Optimization in Telecommunications. Springer, 865\u2013890."},{"key":"e_1_3_2_1_4_1","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs.DS\/0310049(2003)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Luca Becchetti Paolo Boldi Carlos Castillo and Aristides Gionis. 2008. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In KDD.","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_6_1","volume-title":"Higher-order organization of complex networks. Science 353, 6295","author":"Benson R.","year":"2016","unstructured":"Austin\u00a0R. Benson, David\u00a0F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science 353, 6295 (2016)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.056119"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186586"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1086\/421787"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Yi-Jun Chang Fran\u00e7ois\u00a0Le Gall and Dean Leitersdorf. 2021. Tight Distributed Listing of Cliques. In SODA.","DOI":"10.1145\/3382734.3405742"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Lijun Chang and Lu Qin. 2019. Cohesive Subgraph Computation Over Large Sparse Graphs. In ICDE.","DOI":"10.1007\/978-3-030-03599-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Shumo Chu and James Cheng. 2011. Triangle listing in massive networks and its applications. In KDD.","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Maximilien Danisch Oana Balalau and Mauro Sozio. 2018. Listing k-cliques in Sparse Real-World Graphs. In WWW.","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Talya Eden Dana Ron and C. Seshadhri. 2018. On approximating the number of k-cliques in sublinear time. In STOC.","DOI":"10.1145\/3188745.3188810"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Talya Eden Dana Ron and C. Seshadhri. 2020. Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. In SODA.","DOI":"10.1137\/1.9781611975994.89"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2794080"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Lukas Gianinazzi Maciej Besta Yannick Schaffner and Torsten Hoefler. 2021. Parallel Algorithms for Finding Large Cliques in Sparse Graphs. In SPAA.","DOI":"10.1145\/3409964.3461800"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"William Hasenplaugh Tim Kaler Tao\u00a0B. Schardl and Charles\u00a0E. Leiserson. 2014. Ordering heuristics for parallel graph coloring. In SPAA.","DOI":"10.1145\/2612669.2612697"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Lin Hu Lei Zou and Yu Liu. 2021. Accelerating Triangle Counting on GPU. In SIGMOD.","DOI":"10.1145\/3448016.3452815"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n\u2019s Theorem. In WWW.","DOI":"10.1145\/3038912.3052636"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Shweta Jain and C. Seshadhri. 2020. The Power of Pivoting for Exact Clique Counting. In WSDM.","DOI":"10.1145\/3336191.3371839"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380264"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407843"},{"key":"e_1_3_2_1_29_1","volume-title":"New Algorithms for Enumerating All Maximal Cliques. In 9th Scandinavian Workshop on Algorithm Theory.","author":"Makino Kazuhisa","year":"2004","unstructured":"Kazuhisa Makino and Takeaki Uno. 2004. New Algorithms for Enumerating All Maximal Cliques. In 9th Scandinavian Workshop on Algorithm Theory."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_31_1","volume-title":"Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594","author":"Milo R.","year":"2010","unstructured":"R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D Chklovskii, and U. Alon. 2010. Network Motifs: Simple Building Blocks of Complex Networks. Science 298, 5594 (2010), 763\u2013764."},{"key":"e_1_3_2_1_32_1","unstructured":"Mark Ortmann and Ulrik Brandes. 2014. Triangle Listing Algorithms: Back from the Diversion. In ALENEX."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Noujan Pashanasangi and C. Seshadhri. 2020. Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs by EVOKE. In WSDM.","DOI":"10.1145\/3336191.3371773"},{"key":"e_1_3_2_1_34_1","volume-title":"ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. In WWW.","author":"Pinar Ali","year":"2017","unstructured":"Ali Pinar, C. Seshadhri, and Vaidyanathan Vishal. 2017. ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. In WWW."},{"key":"e_1_3_2_1_35_1","volume-title":"Modeling interactome: scale-free or geometric?Bioinform. 20, 18","author":"Przulj Natasa","year":"2004","unstructured":"Natasa Przulj, Derek\u00a0G. Corneil, and Igor Jurisica. 2004. Modeling interactome: scale-free or geometric?Bioinform. 20, 18 (2004), 3508\u20133515."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.2297929"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Ahmet\u00a0Erdem Sariy\u00fcce C. Seshadhri Ali Pinar and \u00dcmit\u00a0V. \u00c7ataly\u00fcrek. 2015. Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. In WWW.","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Comandur Seshadhri and Srikanta Tirthapura. 2019. Scalable Subgraph Counting: The Methods Behind The Madness. In WWW.","DOI":"10.1145\/3308560.3320092"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_1_40_1","unstructured":"Ancy\u00a0Sarah Tom Narayanan Sundaram Nesreen\u00a0K. Ahmed Shaden Smith Stijn Eyerman Midhunchandra Kodiyath Ibrahim Hur Fabrizio Petrini and George Karypis. 2017. Exploring optimizations on shared-memory platforms for parallel triangle counting algorithms. In HPEC."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Charalampos\u00a0E. Tsourakakis. 2015. The K-clique Densest Subgraph Problem. In WWW.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Charalampos\u00a0E. Tsourakakis U Kang Gary\u00a0L. Miller and Christos Faloutsos. 2009. DOULION: counting triangles in massive graphs with a coin. In KDD.","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.052306"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157802"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512167","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:14Z","timestamp":1750188674000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":46,"alternative-id":["10.1145\/3485447.3512167","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512167","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}