{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T02:11:04Z","timestamp":1784167864336,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T00:00:00Z","timestamp":1691366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Delta research computing project","award":["OCI 2005572"],"award-info":[{"award-number":["OCI 2005572"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,7]]},"DOI":"10.1145\/3605573.3605653","type":"proceedings-article","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:21:16Z","timestamp":1694622076000},"page":"142-152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["BEEP: Balanced Efficient subgraph Enumeration in Parallel"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2243-5825","authenticated-orcid":false,"given":"Samiran","family":"Kawtikwar","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana Champaign, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3154-4433","authenticated-orcid":false,"given":"Mohammad","family":"Almasri","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2532-5349","authenticated-orcid":false,"given":"Wen-Mei","family":"Hwu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4022-6277","authenticated-orcid":false,"given":"Rakesh","family":"Nagi","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana Champaign, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-4859","authenticated-orcid":false,"given":"Jinjun","family":"Xiong","sequence":"additional","affiliation":[{"name":"University at Buffalo, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,9,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916285"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Mohammad Almasri Yen-Hsiang Chang Izzat\u00a0El Hajj Rakesh Nagi Jinjun Xiong and Wen-mei Hwu. 2022. Parallelizing Maximal Clique Enumeration on GPUs. https:\/\/doi.org\/10.48550\/ARXIV.2212.01473","DOI":"10.48550\/ARXIV.2212.01473"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532382"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics"},{"key":"e_1_3_2_1_5_1","volume-title":"Mining Contrasting Quasi-Clique Patterns. CoRR abs\/1810.01836","author":"Alonso Roberto","year":"2018","unstructured":"Roberto Alonso and Stephan G\u00fcnnemann. 2018. Mining Contrasting Quasi-Clique Patterns. CoRR abs\/1810.01836 (2018). http:\/\/arxiv.org\/abs\/1810.01836"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2696940"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Xuhao Chen and Arvind. 2021. Efficient and Scalable Graph Pattern Mining on GPUs. https:\/\/doi.org\/10.48550\/ARXIV.2112.09761","DOI":"10.48550\/ARXIV.2112.09761"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3087368.3087386"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.06.085"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00025"},{"key":"e_1_3_2_1_13_1","volume-title":"An Improved Algorithm for Matching Large Graphs. In 3rd IAPR-TC-15 International Workshop on Graph-based Representation. springer","author":"Foggia Pasquale","year":"2001","unstructured":"Pasquale Foggia, Carlo Sansone, and Mario Vento. 2001. An Improved Algorithm for Matching Large Graphs. In 3rd IAPR-TC-15 International Workshop on Graph-based Representation. springer, Ischia, Italy, 149\u2013159."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389699"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3035564"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci000149u"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_19_1","volume-title":"METIS\u2014A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes and Computing Fill-Reducing Ordering of Sparse Matrices","author":"Karypis George","unstructured":"George Karypis and Vipin Kumar. 1997. METIS\u2014A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes and Computing Fill-Reducing Ordering of Sparse Matrices. University of Minnesota Digital Conservancy. https:\/\/hdl.handle.net\/11299\/215346"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_3_2_1_22_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford large network dataset collection."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547517"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_3_2_1_25_1","volume-title":"Uncovering biological network function via graphlet degree signatures. Cancer informatics 6","author":"Milenkovi\u0107 Tijana","year":"2008","unstructured":"Tijana Milenkovi\u0107 and Natasa Przulj. 2008. Uncovering biological network function via graphlet degree signatures. Cancer informatics 6 (2008), 257\u2013273. https:\/\/pubmed.ncbi.nlm.nih.gov\/19259413"},{"key":"e_1_3_2_1_26_1","volume-title":"NVIDIA Tesla V100 GPU Architecture","author":"NVIDIA Corporation","unstructured":"NVIDIA Corporation. 2017. NVIDIA Tesla V100 GPU Architecture, Data Center GPU. NVIDIA. https:\/\/www.nvidia.com\/en-us\/data-center\/v100\/"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0968-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, Vol.\u00a05. PMLR","author":"Shervashidze Nino","year":"2009","unstructured":"Nino Shervashidze, SVN Vishwanathan, Tobias Petri, Kurt Mehlhorn, and Karsten Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics, Vol.\u00a05. PMLR, San Francisco, CA. USA, 488\u2013495."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00029"},{"key":"e_1_3_2_1_33_1","volume-title":"Database Systems for Advanced Applications","author":"Tran Ha-Nguyen","unstructured":"Ha-Nguyen Tran, Jung-jae Kim, and Bingsheng He. 2015. Fast Subgraph Matching on Large Graphs using Graphics Processors. In Database Systems for Advanced Applications. Springer International Publishing, Cham, 299\u2013315."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_35_1","volume-title":"Complexity Theory - Exploring the Limits of Efficient Algorithms","author":"Wegener Ingo","unstructured":"Ingo Wegener. 2005. Complexity Theory - Exploring the Limits of Efficient Algorithms. Springer, Berlin, Heidelberg."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476214"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100267"}],"event":{"name":"ICPP 2023: 52nd International Conference on Parallel Processing","location":"Salt Lake City UT USA","acronym":"ICPP 2023"},"container-title":["Proceedings of the 52nd International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605573.3605653","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3605573.3605653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:04Z","timestamp":1750182544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3605573.3605653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,7]]},"references-count":37,"alternative-id":["10.1145\/3605573.3605653","10.1145\/3605573"],"URL":"https:\/\/doi.org\/10.1145\/3605573.3605653","relation":{},"subject":[],"published":{"date-parts":[[2023,8,7]]},"assertion":[{"value":"2023-09-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}