{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:17:05Z","timestamp":1780766225514,"version":"3.54.1"},"reference-count":89,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong RGC ECS grant","award":["24203419"],"award-info":[{"award-number":["24203419"]}]},{"name":"RGC CRF grant","award":["C4158-20G"],"award-info":[{"award-number":["C4158-20G"]}]},{"DOI":"10.13039\/100008982","name":"Qatar National Research Fund","doi-asserted-by":"crossref","award":["NPRP11C-1229-170007"],"award-info":[{"award-number":["NPRP11C-1229-170007"]}],"id":[{"id":"10.13039\/100008982","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSFC grant","award":["U1936205"],"award-info":[{"award-number":["U1936205"]}]},{"name":"RGC GRF grant","award":["14217322"],"award-info":[{"award-number":["14217322"]}]},{"name":"ARC Discovery Early Career Researcher Award","award":["DE190101118"],"award-info":[{"award-number":["DE190101118"]}]},{"name":"Hong Kong ITC ITF grant","award":["MRP\/071\/20X"],"award-info":[{"award-number":["MRP\/071\/20X"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,12,8]]},"abstract":"<jats:p>A bipartite graph is a graph that consists of two disjoint sets of vertices and only edges between vertices from different vertex sets. In this paper, we study the counting problems of two common types of em motifs in bipartite graphs: (i) butterflies (2x2 bicliques) and (ii) bi-triangles (length-6 cycles). Unlike most of the existing algorithms that aim to obtain exact counts, our goal is to obtain precise enough estimations of these counts in bipartite graphs, as such estimations are already sufficient and of great usefulness in various applications. While there exist approximate algorithms for butterfly counting, these algorithms are mainly based on the techniques designed for general graphs, and hence, they are less effective on bipartite graphs. Not to mention that there is still a lack of study on approximate bi-triangle counting. Motivated by this, we first propose a novel butterfly counting algorithm, called one-sided weighted sampling, which is tailored for bipartite graphs. The basic idea of this algorithm is to estimate the total butterfly count with the number of butterflies containing two randomly sampled vertices from the same side of the two vertex sets. We prove that our estimation is unbiased, and our technique can be further extended (non-trivially) for bi-triangle count estimation. Theoretical analyses under a power-law random bipartite graph model and extensive experiments on multiple large real datasets demonstrate that our proposed approximate counting algorithms can reach high accuracy, yet achieve up to three orders (resp. four orders) of magnitude speed-up over the state-of-the-art exact butterfly (resp. bi-triangle) counting algorithms. Additionally, we present an approximate clustering coefficient estimation framework for bipartite graphs, which shows a similar speed-up over the exact solutions with less than 1% relative error.<\/jats:p>","DOI":"10.1145\/3626753","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T14:01:21Z","timestamp":1702389681000},"page":"1-26","source":"Crossref","is-referenced-by-count":6,"title":["Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3253-4661","authenticated-orcid":false,"given":"Fangyuan","family":"Zhang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8148-3883","authenticated-orcid":false,"given":"Dechuang","family":"Chen","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1892-6971","authenticated-orcid":false,"given":"Sibo","family":"Wang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0549-3882","authenticated-orcid":false,"given":"Yin","family":"Yang","sequence":"additional","affiliation":[{"name":"Hamad Bin Khalifa University, Doha, Qatar"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9101-1503","authenticated-orcid":false,"given":"Junhao","family":"Gan","sequence":"additional","affiliation":[{"name":"University of Melbourne, Melbourne, VIC, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2013. KONECT. http:\/\/konect.cc\/networks\/."},{"key":"e_1_2_1_2_1","unstructured":"2023. Code and technical report. https:\/\/github.com\/CUHK-DBGroup\/SIGMOD24-Butterfly-Bi-Triangle-Counting."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Nesreen K. Ahmed Nick G. Duffield Jennifer Neville and Ramana Rao Kompella. 2014. Graph sample and hold: a framework for big-graph analytics. In KDD. 1446--1455.","DOI":"10.1145\/2623330.2623757"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"William Aiello Fan R. K. Chung and Linyuan Lu. 2000. A random graph model for massive graphs. In STOC. 171--180.","DOI":"10.1145\/335305.335326"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.066102"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3150\/14-BEJ605"},{"key":"e_1_2_1_8_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. 16--24.","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.052"},{"key":"e_1_2_1_10_1","volume-title":"Network analysis of 2-mode data. Social networks 19, 3","author":"Borgatti Stephen P","year":"1997","unstructured":"Stephen P Borgatti and Martin G Everett. 1997. Network analysis of 2-mode data. Social networks 19, 3 (1997), 243--269."},{"key":"e_1_2_1_11_1","volume-title":"Chawathe and Hector Garcia-Molina","author":"Sudarshan","year":"1997","unstructured":"Sudarshan S. Chawathe and Hector Garcia-Molina. 1997. Meaningful Change Detection in Structured Data. In SIGMOD. 26--37."},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Tianqi Chen and Carlos Guestrin. 2016. XGBoost: A Scalable Tree Boosting System. In SIGKDD. 785--794.","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Xingguang Chen and Sibo Wang. 2021. Efficient Approximate Algorithms for Empirical Entropy and Mutual Information. In SIGMOD. 274--286.","DOI":"10.1145\/3448016.3457255"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Xingguang Chen Fangyuan Zhang and Sibo Wang. 2022. Efficient Approximate Algorithms for Empirical Variance with Hashed Block Sampling. In SIGKDD. 157--167.","DOI":"10.1145\/3534678.3539377"},{"key":"e_1_2_1_15_1","series-title":"SIAM Journal on computing 14, 1","volume-title":"Arboricity and subgraph listing algorithms","author":"Chiba Norishige","year":"1985","unstructured":"Norishige Chiba and Takao Nishizeki. 1985. Arboricity and subgraph listing algorithms. SIAM Journal on computing 14, 1 (1985), 210--223."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Hongbo Deng Michael R. Lyu and Irwin King. 2009. A generalized Co-HITS algorithm and its application to bipartite graphs. In SIGKDD. 239--248.","DOI":"10.1145\/1557019.1557051"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Inderjit S. Dhillon. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In SIGKDD. 269--274.","DOI":"10.1145\/502512.502550"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_2_1_21_1","volume-title":"Brodley","author":"Fern Xiaoli Zhang","year":"2004","unstructured":"Xiaoli Zhang Fern and Carla E. Brodley. 2004. Solving cluster ensemble problems by bipartite graph partitioning. In ICML."},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Qintian Guo Sibo Wang Zhewei Wei and Ming Chen. 2020. Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened. In SIGMOD. 2167--2181.","DOI":"10.1145\/3318464.3389740"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533817"},{"key":"e_1_2_1_24_1","volume-title":"Dave","author":"Hasan Mohammad Al","year":"2018","unstructured":"Mohammad Al Hasan and Vachik S. Dave. 2018. Triangle counting in large networks: a review. WIREs Data Mining Knowl. Discov. 8, 2 (2018)."},{"key":"e_1_2_1_25_1","volume-title":"Local structure in social networks. Sociological methodology 7","author":"Holland Paul W","year":"1976","unstructured":"Paul W Holland and Samuel Leinhardt. 1976. Local structure in social networks. Sociological methodology 7 (1976), 1--45."},{"key":"e_1_2_1_26_1","volume-title":"Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos.","author":"Hooi Bryan","year":"2016","unstructured":"Bryan Hooi, Hyun Ah Song, Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos. 2016. FRAUDAR: Bounding Graph Fraud in the Face of Camouflage. In SIGKDD. 895--904."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588705"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Xiaocheng Hu Yufei Tao and Chin-Wan Chung. 2013. Massive graph triangulation. In SIGMOD. 325--336.","DOI":"10.1145\/2463676.2463704"},{"key":"e_1_2_1_29_1","volume-title":"Data Path Allocation Based on Bipartite Weighted Matching","author":"Huang Chu-Yi","unstructured":"Chu-Yi Huang, Yen-Shen Chen, Youn-Long Lin, and Yu-Chin Hsu. 1990. Data Path Allocation Based on Bipartite Weighted Matching. In DAC. IEEE Computer Society Press, 499--504."},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In SIGMOD. 1311--1322.","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_31_1","volume-title":"Lakshmanan","author":"Huang Xin","year":"2016","unstructured":"Xin Huang, Wei Lu, and Laks V. S. Lakshmanan. 2016. Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms. In SIGMOD. 77--90."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Alon Itai. 1977. Finding a Minimum Circuit in a Graph. In STOC. 1--10.","DOI":"10.1145\/800105.803390"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514070"},{"key":"e_1_2_1_35_1","volume-title":"Graphs: The Power of Wedge Sampling. In SDM. 10--18.","author":"Kolda Tamara G.","year":"2013","unstructured":"Tamara G. Kolda, Ali Pinar, and C. Seshadhri. 2013. Triadic Measures on Graphs: The Power of Wedge Sampling. In SDM. 10--18."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. KONECT: the Koblenz network collection. In WWW. 1343--1350.","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_2_1_37_1","unstructured":"Los Alamos National Laboratory. 2023. Networkx. https:\/\/networkx.org\/."},{"key":"e_1_2_1_38_1","volume-title":"Basic notions for the analysis of large two-mode networks. Social networks 30, 1","author":"Latapy Matthieu","year":"2008","unstructured":"Matthieu Latapy, Cl\u00e9mence Magnien, and Nathalie Del Vecchio. 2008. Basic notions for the analysis of large two-mode networks. Social networks 30, 1 (2008), 31--48."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1005345"},{"key":"e_1_2_1_40_1","volume-title":"Wander Join: Online Aggregation via Random Walks. In SIGMOD. 615--629.","author":"Li Feifei","year":"2016","unstructured":"Feifei Li, Bin Wu, Ke Yi, and Zhuoyue Zhao. 2016. Wander Join: Online Aggregation via Random Walks. In SIGMOD. 615--629."},{"key":"e_1_2_1_41_1","volume-title":"Cycles and clustering in bipartite networks. Physical review E 72, 5","author":"Lind Pedro G","year":"2005","unstructured":"Pedro G Lind, Marta C Gonz\u00e1lez, and Hans J Herrmann. 2005. Cycles and clustering in bipartite networks. Physical review E 72, 5 (2005), 056127."},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Boge Liu Long Yuan Xuemin Lin Lu Qin Wenjie Zhang and Jingren Zhou. 2019. Efficient (? ?)-core Computation: an Index-based Approach. In WWW. 1130--1141.","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Xin Liu and Tsuyoshi Murata. 2009. Community Detection in Large-Scale Bipartite Networks. In Web Intelligence. 50--57.","DOI":"10.1109\/WI-IAT.2009.15"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397234"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In STOC. 597--606.","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352135"},{"key":"e_1_2_1_47_1","volume-title":"Network motifs: simple building blocks of complex networks. Science 298, 5594","author":"Milo Ron","year":"2002","unstructured":"Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 (2002), 824--827."},{"key":"e_1_2_1_48_1","volume-title":"Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc. Networks","author":"Opsahl Tore","year":"2013","unstructured":"Tore Opsahl. 2013. Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc. Networks (2013), 159--167."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(82)90011-9"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_2_1_51_1","volume-title":"e177--e183","author":"Biological","year":"2007","unstructured":"Biological network comparison using graphlet degree distribution. Bioinformatics 23, 2 (2007), e177--e183."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3433652"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:CMOT.0000032580.12184.c0"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Boyu Ruan Junhao Gan Hao Wu and Anthony Wirth. 2021. Dynamic Structural Clustering on Graphs. In SIGMOD. 1491--1503.","DOI":"10.1145\/3448016.3452828"},{"key":"e_1_2_1_55_1","volume-title":"Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura","author":"Sanei-Mehri Seyed-Vahid","year":"2018","unstructured":"Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura. 2018. Butterfly Counting in Bipartite Networks. In SIGKDD. 2150--2159."},{"key":"e_1_2_1_56_1","volume-title":"Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura","author":"Sanei-Mehri Seyed-Vahid","year":"2019","unstructured":"Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura. 2019. FLEET: Butterfly Estimation from a Bipartite Graph Stream. In CIKM. 1201--1210."},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Ahmet Erdem Sariy\u00fcce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM. 504--512.","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00108"},{"key":"e_1_2_1_59_1","volume-title":"Borgwardt","author":"Shervashidze Nino","year":"2009","unstructured":"Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, and Karsten M. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In AISTATS (JMLR Proceedings, Vol. 5). 488--495."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3495011"},{"key":"e_1_2_1_61_1","volume-title":"Parallel Algorithms for Butterfly Computations","author":"Shi Jessica","unstructured":"Jessica Shi and Julian Shun. 2020. Parallel Algorithms for Butterfly Computations. In APOCS. SIAM, 16--30."},{"key":"e_1_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Julian Shun and Kanat Tangwongsan. 2015. Multicore triangle computations without tuning. In ICDE. 149--160.","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Jimeng Sun Huiming Qu Deepayan Chakrabarti and Christos Faloutsos. 2005. Neighborhood Formation and Anomaly Detection in Bipartite Graphs. In ICDM. 418--425.","DOI":"10.1109\/ICDM.2005.103"},{"key":"e_1_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Siddharth Suri and Sergei Vassilvitskii. 2011. Counting triangles and the curse of the last reducer. In WWW. 607--614.","DOI":"10.1145\/1963405.1963491"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.suppl_1.S136"},{"key":"e_1_2_1_66_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Yanchen Shi and Xiaokui Xiao. 2015. Influence Maximization in Near-Linear Time: A Martingale Approach. In SIGMOD. 1539--1554.","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Charalampos E. Tsourakakis U Kang Gary L. Miller and Christos Faloutsos. 2009. DOULION: counting triangles in massive graphs with a coin. In SIGKDD. 837--846.","DOI":"10.1145\/1557019.1557111"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Duru T\u00fcrkoglu and Ata Turk. 2017. Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs. In ICDM. 455--464.","DOI":"10.1109\/ICDM.2017.55"},{"key":"e_1_2_1_69_1","volume-title":"Kleinberg","author":"Ugander Johan","year":"2013","unstructured":"Johan Ugander, Lars Backstrom, and Jon M. Kleinberg. 2013. Subgraph frequencies: mapping the empirical and extremal geography of large graph collections. In WWW. 1307--1318."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.98.022307"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355749"},{"key":"e_1_2_1_72_1","volume-title":"Rectangle Counting in Large Bipartite Graphs. In IEEE International Congress on Big Data. 17--24","author":"Wang Jia","year":"2014","unstructured":"Jia Wang, Ada Wai-Chee Fu, and James Cheng. 2014. Rectangle Counting in Large Bipartite Graphs. In IEEE International Congress on Big Data. 17--24."},{"key":"e_1_2_1_73_1","doi-asserted-by":"crossref","unstructured":"Kai Wang Yiheng Hu Xuemin Lin Wenjie Zhang Lu Qin and Ying Zhang. 2021. A Cohesive Structure Based Bipartite Graph Analytics System. In CIKM. 4799--4803.","DOI":"10.1145\/3459637.3481963"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Kai Wang Xuemin Lin Lu Qin Wenjie Zhang and Ying Zhang. 2020. Efficient Bitruss Decomposition for Large-scale Bipartite Graphs. In ICDE. 661--672.","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"e_1_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Kai Wang Xuemin Lin Lu Qin Wenjie Zhang and Ying Zhang. 2022. Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. (2022).","DOI":"10.1007\/s00778-022-00746-0"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00658-5"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021936"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"e_1_2_1_80_1","doi-asserted-by":"crossref","unstructured":"Xiang Wang Xiangnan He Meng Wang Fuli Feng and Tat-Seng Chua. 2019. Neural Graph Collaborative Filtering. In SIGIR. 165--174.","DOI":"10.1145\/3331184.3331267"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551806"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489497"},{"key":"e_1_2_1_83_1","doi-asserted-by":"crossref","unstructured":"Yixing Yang Yixiang Fang Xuemin Lin and Wenjie Zhang. 2020. Effective and Efficient Truss Computation over Large Heterogeneous Information Networks. In ICDE. 901--912.","DOI":"10.1109\/ICDE48307.2020.00083"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447702"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.14778\/3617838.3617840"},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551840"},{"key":"e_1_2_1_87_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, 1","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, 1 (2014), 1--18."},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489502"},{"key":"e_1_2_1_89_1","volume-title":"Jie Ren and Yi-Cheng Zhang","author":"Zhou Tao","year":"2007","unstructured":"Tao Zhou, Jie Ren and Yi-Cheng Zhang. 2007. Bipartite network projection and personal recommendation. Physical review E 76, 4 (2007), 046115."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626753","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T13:04:13Z","timestamp":1755867853000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,8]]},"references-count":89,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12,8]]}},"alternative-id":["10.1145\/3626753"],"URL":"https:\/\/doi.org\/10.1145\/3626753","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,8]]}}}