{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:11:48Z","timestamp":1758708708575,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T00:00:00Z","timestamp":1699660800000},"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":[[2023,11,12]]},"DOI":"10.1145\/3581784.3607059","type":"proceedings-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T21:47:06Z","timestamp":1699998426000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Maximal Biclique Enumeration on GPUs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0355-8099","authenticated-orcid":false,"given":"Zhe","family":"Pan","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7075-4153","authenticated-orcid":false,"given":"Shuibing","family":"He","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4777-999X","authenticated-orcid":false,"given":"Xu","family":"Li","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3730-8901","authenticated-orcid":false,"given":"Xuechen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Washington State University Vancouver, Vancouver WA, United States of America"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8915-4169","authenticated-orcid":false,"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7483-0045","authenticated-orcid":false,"given":"Gang","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,11]]},"reference":[{"unstructured":"2022. CUDA C++ programming guide. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/.  2022. CUDA C++ programming guide. https:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/.","key":"e_1_3_2_1_1_1"},{"unstructured":"2023. CUDA from Wikipedia. https:\/\/en.wikipedia.org\/wiki\/CUDA.  2023. CUDA from Wikipedia. https:\/\/en.wikipedia.org\/wiki\/CUDA.","key":"e_1_3_2_1_2_1"},{"unstructured":"2023. GeForce RTX 20 Series. https:\/\/www.nvidia.com\/en-gb\/geforce\/20-series\/.  2023. GeForce RTX 20 Series. https:\/\/www.nvidia.com\/en-gb\/geforce\/20-series\/.","key":"e_1_3_2_1_3_1"},{"unstructured":"2023. NVIDIA A100 Tensor Core GPU. https:\/\/www.nvidia.com\/en-gb\/data-center\/a100\/.  2023. NVIDIA A100 Tensor Core GPU. https:\/\/www.nvidia.com\/en-gb\/data-center\/a100\/.","key":"e_1_3_2_1_4_1"},{"unstructured":"2023. NVIDIA Nsight Compute. https:\/\/developer.nvidia.com\/nsight-compute\/.  2023. NVIDIA Nsight Compute. https:\/\/developer.nvidia.com\/nsight-compute\/.","key":"e_1_3_2_1_5_1"},{"unstructured":"2023. NVIDIA V100 Tensor Core GPU. https:\/\/www.nvidia.com\/en-gb\/data-center\/v100\/.  2023. NVIDIA V100 Tensor Core GPU. https:\/\/www.nvidia.com\/en-gb\/data-center\/v100\/.","key":"e_1_3_2_1_6_1"},{"unstructured":"2023. Single instruction multiple threads (SIMT) from Wikipedia. https:\/\/en.wikipedia.org\/wiki\/Single_instruction _multiple_threads.  2023. Single instruction multiple threads (SIMT) from Wikipedia. https:\/\/en.wikipedia.org\/wiki\/Single_instruction _multiple_threads.","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"crossref","unstructured":"Aman Abidi Rui Zhou Lu Chen and Chengfei Liu. 2020. Pivot-based Maximal Biclique Enumeration.. In IJCAI. 3558--3564.  Aman Abidi Rui Zhou Lu Chen and Chengfei Liu. 2020. Pivot-based Maximal Biclique Enumeration.. In IJCAI. 3558--3564.","key":"e_1_3_2_1_8_1","DOI":"10.24963\/ijcai.2020\/492"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/j.dam.2003.09.004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/978-3-642-37401-2_21"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3524059.3532382"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/978-3-642-41299-8_24"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/IISWC.2012.6402918"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.14778\/3529337.3529341"},{"volume-title":"Efficient and Scalable Graph Pattern Mining on GPUs. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Xuhao","unstructured":"Xuhao Chen et al. 2022 . Efficient and Scalable Graph Pattern Mining on GPUs. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22) . 857--877. Xuhao Chen et al. 2022. Efficient and Scalable Graph Pattern Mining on GPUs. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). 857--877.","key":"e_1_3_2_1_15_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/MICRO.2014.11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/3447818.3460359"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/HiPC.2019.00016"},{"key":"e_1_3_2_1_19_1","volume-title":"Arboricity and bipartite subgraph listing algorithms. Information processing letters 51, 4","author":"Eppstein David","year":"1994","unstructured":"David Eppstein . 1994. Arboricity and bipartite subgraph listing algorithms. Information processing letters 51, 4 ( 1994 ), 207--211. David Eppstein. 1994. Arboricity and bipartite subgraph listing algorithms. Information processing letters 51, 4 (1994), 207--211."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/TKDE.2020.3035564"},{"doi-asserted-by":"crossref","unstructured":"Kshitij Gupta Jeff A Stuart and John D Owens. 2012. A study of persistent threads style GPU programming for GPGPU workloads. In 2012 Innovative Parallel Computing (InPar). 1--14.  Kshitij Gupta Jeff A Stuart and John D Owens. 2012. A study of persistent threads style GPU programming for GPGPU workloads. In 2012 Innovative Parallel Computing (InPar). 1--14.","key":"e_1_3_2_1_21_1","DOI":"10.1109\/InPar.2012.6339596"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/j.dam.2020.04.034"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.5555\/305219.305248"},{"volume-title":"Proceedings of the 2019 SIAM International Conference on Data Mining. SIAM, 324--332","author":"Kloster Kyle","unstructured":"Kyle Kloster , Blair D Sullivan , and Andrew van der Poel. 2019. Mining maximal induced bicliques using odd cycle transversals . In Proceedings of the 2019 SIAM International Conference on Data Mining. SIAM, 324--332 . Kyle Kloster, Blair D Sullivan, and Andrew van der Poel. 2019. Mining maximal induced bicliques using odd cycle transversals. In Proceedings of the 2019 SIAM International Conference on Data Mining. SIAM, 324--332.","key":"e_1_3_2_1_24_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/2487788.2488173"},{"unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data.","key":"e_1_3_2_1_26_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1109\/LDAV.2017.8231847"},{"unstructured":"Yuan Lin and Vinod Grover. 2018. Using cuda warp-level primitives. https:\/\/developer.nvidia.com\/blog\/using-cuda-warp-level-primitives\/.  Yuan Lin and Vinod Grover. 2018. Using cuda warp-level primitives. https:\/\/developer.nvidia.com\/blog\/using-cuda-warp-level-primitives\/.","key":"e_1_3_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/11823728_42"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.14778\/3397230.3397234"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/s11280-021-00927-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1109\/TSC.2016.2523997"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR). 539--550","author":"Rymon Ron","year":"1992","unstructured":"Ron Rymon . 1992 . Search through systematic set enumeration . In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR). 539--550 . Ron Rymon. 1992. Search through systematic set enumeration. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR). 539--550."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1109\/ICDE53745.2022.00042"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1109\/TPDS.2021.3067053"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/3437801.3441612"},{"key":"e_1_3_2_1_38_1","volume-title":"q)-biclique counting and enumeration for large sparse bipartite graphs. The VLDB Journal","author":"Yang Jianye","year":"2023","unstructured":"Jianye Yang , Yun Peng , Dian Ouyang , Wenjie Zhang , Xuemin Lin , and Xiang Zhao . 2023. (p , q)-biclique counting and enumeration for large sparse bipartite graphs. The VLDB Journal ( 2023 ), 1--25. Jianye Yang, Yun Peng, Dian Ouyang, Wenjie Zhang, Xuemin Lin, and Xiang Zhao. 2023. (p, q)-biclique counting and enumeration for large sparse bipartite graphs. The VLDB Journal (2023), 1--25."},{"key":"e_1_3_2_1_39_1","volume-title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15","author":"Zhang Yun","year":"2014","unstructured":"Yun Zhang , Charles A Phillips , Gary L Rogers , Erich J Baker , Elissa J Chesler , and Michael A Langston . 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15 ( 2014 ), 1--18. Yun Zhang, Charles A Phillips, Gary L Rogers, Erich J Baker, Elissa J Chesler, and Michael A Langston. 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15 (2014), 1--18."}],"event":{"sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"],"acronym":"SC '23","name":"SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Denver CO USA"},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607059","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3581784.3607059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:23Z","timestamp":1750178183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3581784.3607059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,11]]},"references-count":39,"alternative-id":["10.1145\/3581784.3607059","10.1145\/3581784"],"URL":"https:\/\/doi.org\/10.1145\/3581784.3607059","relation":{},"subject":[],"published":{"date-parts":[[2023,11,11]]},"assertion":[{"value":"2023-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}