{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:42:39Z","timestamp":1762508559747,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"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,7,6]]},"DOI":"10.1145\/3409964.3461800","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"243-253","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Parallel Algorithms for Finding Large Cliques in Sparse Graphs"],"prefix":"10.1145","author":[{"given":"Lukas","family":"Gianinazzi","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Besta","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannick","family":"Schaffner","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"e_1_3_2_1_2_1","volume-title":"Rakesh Nagi, Jinjun Xiong, and Wen-mei Hwu. K-clique counting on gpus. arXiv preprint arXiv:2104.13209","author":"Almasri Mohammad","year":"2021","unstructured":"Mohammad Almasri , Izzat El Hajj , Rakesh Nagi, Jinjun Xiong, and Wen-mei Hwu. K-clique counting on gpus. arXiv preprint arXiv:2104.13209 , 2021 . Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, and Wen-mei Hwu. K-clique counting on gpus. arXiv preprint arXiv:2104.13209, 2021."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00103"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3433701.3433833"},{"key":"e_1_3_2_1_5_1","volume-title":"Practice of streaming processing of dynamic graphs: Concepts, models, and systems. arXiv preprint arXiv:1912.12740","author":"Besta Maciej","year":"2019","unstructured":"Maciej Besta , Marc Fischer , Vasiliki Kalavri , Michael Kapralov , and Torsten Hoefler . Practice of streaming processing of dynamic graphs: Concepts, models, and systems. arXiv preprint arXiv:1912.12740 , 2019 . Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, and Torsten Hoefler. Practice of streaming processing of dynamic graphs: Concepts, models, and systems. arXiv preprint arXiv:1912.12740, 2019."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749263"},{"key":"e_1_3_2_1_7_1","volume-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799","author":"Besta Maciej","year":"2018","unstructured":"Maciej Besta and Torsten Hoefler . Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799 , 2018 . Maciej Besta and Torsten Hoefler. Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799, 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"et al. Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems. arXiv preprint arXiv:2104.07582","author":"Besta Maciej","year":"2021","unstructured":"Maciej Besta , Raghavendra Kanakagiri , Grzegorz Kwasniewski , Rachata Ausavarungnirun , Jakub Ber\u00e1nek , Konstantinos Kanellopoulos , Kacper Janda , Zur Vonarburg-Shmaria , Lukas Gianinazzi , Ioana Stefan , et al. Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems. arXiv preprint arXiv:2104.07582 , 2021 . Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Ber\u00e1nek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, et al. Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems. arXiv preprint arXiv:2104.07582, 2021."},{"key":"e_1_3_2_1_9_1","volume-title":"Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017","author":"Besta Maciej","year":"2019","unstructured":"Maciej Besta , Emanuel Peter , Robert Gerstenberger , Marc Fischer , Michal Podstawski , Claude Barthels , Gustavo Alonso , and Torsten Hoefler . Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017 , 2019 . Maciej Besta, Emanuel Peter, Robert Gerstenberger, Marc Fischer, Michal Podstawski, Claude Barthels, Gustavo Alonso, and Torsten Hoefler. Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries. arXiv preprint arXiv:1910.09017, 2019."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243176.3243198"},{"key":"e_1_3_2_1_12_1","volume-title":"VLDB","author":"Besta Maciej","year":"2021","unstructured":"Maciej Besta , Zur Vonarburg-Shmaria , Yannick Schaffner , Leonardo Schwarz , Grzegorz Kwasniewski , Lukas Gianinazzi , Jakub Beranek , Kacper Janda , Tobias Holenstein , Sebastian Leisinger , : Enabling highperformance and programmable graph mining algorithms with set algebra . VLDB , 2021 . Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi, Jakub Beranek, Kacper Janda, Tobias Holenstein, Sebastian Leisinger, et al. Graphminesuite: Enabling highperformance and programmable graph mining algorithms with set algebra. VLDB, 2021."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356182"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/227234.227246"},{"key":"e_1_3_2_1_15_1","volume-title":"Listing all potential maximal cliques of a graph. Theoretical Computer Science, 276(1--2):17--32","author":"Bouchitt\u00e9 Vincent","year":"2002","unstructured":"Vincent Bouchitt\u00e9 and Ioan Todinca . Listing all potential maximal cliques of a graph. Theoretical Computer Science, 276(1--2):17--32 , 2002 . Vincent Bouchitt\u00e9 and Ioan Todinca. Listing all potential maximal cliques of a graph. Theoretical Computer Science, 276(1--2):17--32, 2002."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0698-2"},{"key":"e_1_3_2_1_18_1","volume-title":"Jeffrey Xu Yu, and Linhong Zhu. Finding maximal cliques in massive networks. ACM Transactions on Database Systems (TODS), 36(4):1--34","author":"Cheng James","year":"2011","unstructured":"James Cheng , Yiping Ke , Ada Wai-Chee Fu , Jeffrey Xu Yu, and Linhong Zhu. Finding maximal cliques in massive networks. ACM Transactions on Database Systems (TODS), 36(4):1--34 , 2011 . James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, and Linhong Zhu. Finding maximal cliques in massive networks. ACM Transactions on Database Systems (TODS), 36(4):1--34, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339724"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1050985"},{"key":"e_1_3_2_1_23_1","first-page":"589","volume-title":"Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018","author":"Danisch Maximilien","year":"2018","unstructured":"Maximilien Danisch , Oana Balalau , and Mauro Sozio . Listing k-cliques in sparse real-world graphs. In Pierre-Antoine Champin, Fabien L. Gandon, Mounia Lalmas, and Panagiotis G. Ipeirotis, editors , Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018 , Lyon, France, April 23--27 , 2018 , pages 589 -- 598 . ACM, 2018. Maximilien Danisch, Oana Balalau, and Mauro Sozio. Listing k-cliques in sparse real-world graphs. In Pierre-Antoine Champin, Fabien L. Gandon, Mounia Lalmas, and Panagiotis G. Ipeirotis, editors, Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, April 23--27, 2018, pages 589--598. ACM, 2018."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792228228"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2568438"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0464-z"},{"key":"e_1_3_2_1_28_1","volume-title":"Computers and Intractability","author":"Garey Michael R.","year":"1990","unstructured":"Michael R. Garey and David S. Johnson . Computers and Intractability ; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. , USA, 1990 . Michael R. Garey and David S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA, 1990."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407843"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1970-125-1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458288"},{"key":"e_1_3_2_1_36_1","volume-title":"Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society, s1--36(1):445--450","author":"Nash-Williams C. St.J. A.","year":"1961","unstructured":"C. St.J. A. Nash-Williams . Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society, s1--36(1):445--450 , 1961 . C. St.J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society, s1--36(1):445--450, 1961."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90041-7"},{"key":"e_1_3_2_1_38_1","first-page":"88","volume-title":"Seventh International Conference on Digital Information Management (ICDIM 2012","author":"Rehman Saif Ur","year":"2012","unstructured":"Saif Ur Rehman , Asmat Ullah Khan , and Simon Fong . Graph mining : A survey of graph mining techniques . In Seventh International Conference on Digital Information Management (ICDIM 2012 ), pages 88 -- 92 . IEEE, 2012 . Saif Ur Rehman, Asmat Ullah Khan, and Simon Fong. Graph mining: A survey of graph mining techniques. In Seventh International Conference on Digital Information Management (ICDIM 2012), pages 88--92. IEEE, 2012."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/562546"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90032-5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213907"},{"key":"e_1_3_2_1_43_1","volume-title":"Parallel clique counting and peeling algorithms. CoRR, abs\/2002.10047","author":"Shi Jessica","year":"2020","unstructured":"Jessica Shi , Laxman Dhulipala , and Julian Shun . Parallel clique counting and peeling algorithms. CoRR, abs\/2002.10047 , 2020 . Jessica Shi, Laxman Dhulipala, and Julian Shun. Parallel clique counting and peeling algorithms. CoRR, abs\/2002.10047, 2020."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1077-6"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_16"},{"key":"e_1_3_2_1_46_1","volume-title":"IntechOpen","author":"Tomita Etsuji","year":"2011","unstructured":"Etsuji Tomita , Tatsuya Akutsu , and Tsutomu Matsunaga . Efficient algorithms for finding maximum and maximal cliques: Effective tools for bioinformatics. In Biomedical engineering, trends in electronics, communications and software . IntechOpen , 2011 . Etsuji Tomita, Tatsuya Akutsu, and Tsutomu Matsunaga. Efficient algorithms for finding maximum and maximal cliques: Effective tools for bioinformatics. In Biomedical engineering, trends in electronics, communications and software. IntechOpen, 2011."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-007-0738-8"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":50,"alternative-id":["10.1145\/3409964.3461800","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461800","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}