{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T01:18:07Z","timestamp":1789435087029,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":154,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Key R&D Program of China","award":["2018AAA0102502"],"award-info":[{"award-number":["2018AAA0102502"]}]},{"name":"GuangDong Basic and Applied Basic Research Foundation","award":["2019B1515120048"],"award-info":[{"award-number":["2019B1515120048"]}]},{"name":"Australian Research Council","award":["DP200101338 DP210101393 DP200101116"],"award-info":[{"award-number":["DP200101338 DP210101393 DP200101116"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457538","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:37Z","timestamp":1624036957000},"page":"2829-2838","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions"],"prefix":"10.1145","author":[{"given":"Yixiang","family":"Fang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45995-2_51"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/APVIS.2007.329304"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824780"},{"key":"e_1_3_2_2_6_1","volume-title":"On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms. arXiv preprint arXiv:1810.06809","author":"Ban Yikun","year":"2018","unstructured":"Yikun Ban and Yitao Duan . 2018. On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms. arXiv preprint arXiv:1810.06809 ( 2018 ). Yikun Ban and Yitao Duan. 2018. On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms. arXiv preprint arXiv:1810.06809 (2018)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2942323"},{"key":"e_1_3_2_2_8_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik . 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339726"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0949-5"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2015.04.001"},{"key":"e_1_3_2_2_13_1","volume-title":"Efficient and Incremental Clustering Algorithms on Star-Schema Heterogeneous Graphs. In International Conference on Data Engineering (ICDE). IEEE, 256--267","author":"Chen Lu","year":"2019","unstructured":"Lu Chen , Yunjun Gao , Yuanliang Zhang , Christian S Jensen , and Bolong Zheng . 2019 . Efficient and Incremental Clustering Algorithms on Star-Schema Heterogeneous Graphs. In International Conference on Data Engineering (ICDE). IEEE, 256--267 . Lu Chen, Yunjun Gao, Yuanliang Zhang, Christian S Jensen, and Bolong Zheng. 2019. Efficient and Incremental Clustering Algorithms on Star-Schema Heterogeneous Graphs. In International Conference on Data Engineering (ICDE). IEEE, 256--267."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00032"},{"key":"e_1_3_2_2_15_1","volume-title":"2020 a. Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs. arXiv preprint arXiv:2007.08836","author":"Chen Lu","year":"2020","unstructured":"Lu Chen , Chengfei Liu , Rui Zhou , Jiajie Xu , and Jianxin Li . 2020 a. Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs. arXiv preprint arXiv:2007.08836 ( 2020 ). Lu Chen, Chengfei Liu, Rui Zhou, Jiajie Xu, and Jianxin Li. 2020 a. Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs. arXiv preprint arXiv:2007.08836 (2020)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00211"},{"key":"e_1_3_2_2_17_1","volume-title":"2021 a. Efficient structural node similarity computation on billion-scale graphs. The VLDB Journal","author":"Chen Xiaoshuang","year":"2021","unstructured":"Xiaoshuang Chen , Longbin Lai , Lu Qin , and Xuemin Lin . 2021 a. Efficient structural node similarity computation on billion-scale graphs. The VLDB Journal ( 2021 ), 1--23. Xiaoshuang Chen, Longbin Lai, Lu Qin, and Xuemin Lin. 2021 a. Efficient structural node similarity computation on billion-scale graphs. The VLDB Journal (2021), 1--23."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00117"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2882837"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/490"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872823"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00065"},{"key":"e_1_3_2_2_23_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen . 2008 . Trusses: Cohesive subgraphs for social network analysis. National security agency technical report , Vol. 16 (2008), 3--1. Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, Vol. 16 (2008), 3--1."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMSCS.2018.2802920"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"A. Das and S. Tirthapura. 2019. Shared-Memory Parallel Maximal Biclique Enumeration. In HiPC. 34--43.  A. Das and S. Tirthapura. 2019. Shared-Memory Parallel Maximal Biclique Enumeration. In HiPC. 34--43.","DOI":"10.1109\/HiPC.2019.00016"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1199"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1199"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133130"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339670"},{"key":"e_1_3_2_2_31_1","volume-title":"Exploiting drug--disease relationships for computational drug repositioning. Briefings in bioinformatics","author":"Dudley Joel T","year":"2011","unstructured":"Joel T Dudley , Tarangini Deshpande , and Atul J Butte . 2011. Exploiting drug--disease relationships for computational drug repositioning. Briefings in bioinformatics , Vol. 12 , 4 ( 2011 ), 303--311. Joel T Dudley, Tarangini Deshpande, and Atul J Butte. 2011. Exploiting drug--disease relationships for computational drug repositioning. Briefings in bioinformatics, Vol. 12, 4 (2011), 303--311."},{"key":"e_1_3_2_2_32_1","volume-title":"Fast Algorithm for K-Truss Discovery on Public-Private Graphs. In International Joint Conferences on Artificial Intelligence (IJCAI). 2258--2264","author":"Ebadian Soroush","year":"2019","unstructured":"Soroush Ebadian and Xin Huang . 2019 . Fast Algorithm for K-Truss Discovery on Public-Private Graphs. In International Joint Conferences on Artificial Intelligence (IJCAI). 2258--2264 . Soroush Ebadian and Xin Huang. 2019. Fast Algorithm for K-Truss Discovery on Public-Private Graphs. In International Joint Conferences on Artificial Intelligence (IJCAI). 2258--2264."},{"key":"e_1_3_2_2_33_1","volume-title":"Arboricity and bipartite subgraph listing algorithms. Information processing letters","author":"Eppstein David","year":"1994","unstructured":"David Eppstein . 1994. Arboricity and bipartite subgraph listing algorithms. Information processing letters , Vol. 51 , 4 ( 1994 ), 207--211. David Eppstein. 1994. Arboricity and bipartite subgraph listing algorithms. Information processing letters, Vol. 51, 4 (1994), 207--211."},{"key":"e_1_3_2_2_34_1","volume-title":"On Attributed Community Search. In International workshop on Mobility Analytics for Spatio-Temporal and Social Data in VLDB","author":"Fang Yixiang","year":"2017","unstructured":"Yixiang Fang and Reynold Cheng . 2017 . On Attributed Community Search. In International workshop on Mobility Analytics for Spatio-Temporal and Social Data in VLDB 2017. Springer International Publishing, Cham, 1--21. Yixiang Fang and Reynold Cheng. 2017. On Attributed Community Search. In International workshop on Mobility Analytics for Spatio-Temporal and Social Data in VLDB 2017. Springer International Publishing, Cham, 1--21."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137800"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2845414"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2872982"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1177\/0165551514541614"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369872"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_2_48_1","volume-title":"Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength. In International Conference on Database Systems for Advanced Applications (DASFAA). Springer, 448--465","author":"Ghafouri Maryam","year":"2020","unstructured":"Maryam Ghafouri , Kai Wang , Fan Zhang , Ying Zhang , and Xuemin Lin . 2020 . Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength. In International Conference on Database Systems for Advanced Applications (DASFAA). Springer, 448--465 . Maryam Ghafouri, Kai Wang, Fan Zhang, Ying Zhang, and Xuemin Lin. 2020. Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength. In International Conference on Database Systems for Advanced Applications (DASFAA). Springer, 448--465."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_3_2_2_50_1","volume-title":"Algorithmic graph theory","author":"Gibbons Alan","unstructured":"Alan Gibbons . 1985. Algorithmic graph theory . Cambridge university press . Alan Gibbons. 1985. Algorithmic graph theory .Cambridge university press."},{"key":"e_1_3_2_2_51_1","volume-title":"Dense Subgraph Discovery: KDD 2015 Tutorial. In ACM International Conference on Knowledge Discovery and Data Mining (KDD). Association for Computing Machinery","author":"Gionis Aristides","unstructured":"Aristides Gionis and Charalampos E. Tsourakakis . 2015 . Dense Subgraph Discovery: KDD 2015 Tutorial. In ACM International Conference on Knowledge Discovery and Data Mining (KDD). Association for Computing Machinery , New York, NY, USA, 2313--2314. https:\/\/doi.org\/10.1145\/2783258.2789987 10.1145\/2783258.2789987 Aristides Gionis and Charalampos E. Tsourakakis. 2015. Dense Subgraph Discovery: KDD 2015 Tutorial. In ACM International Conference on Knowledge Discovery and Data Mining (KDD). Association for Computing Machinery, New York, NY, USA, 2313--2314. https:\/\/doi.org\/10.1145\/2783258.2789987"},{"key":"e_1_3_2_2_52_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V","unstructured":"Andrew V Goldberg . 1984. Finding a maximum density subgraph . University of California Berkeley , CA. Andrew V Goldberg. 1984. Finding a maximum density subgraph .University of California Berkeley, CA."},{"key":"e_1_3_2_2_53_1","volume-title":"Finding all k-cliques in k-partite graphs, an application in textile engineering. Computers & operations research","author":"Gr\u00fcnert Tore","year":"2002","unstructured":"Tore Gr\u00fcnert , Stefan Irnich , Hans-J\u00fcrgen Zimmermann , Markus Schneider , and Burkhard Wulfhorst . 2002. Finding all k-cliques in k-partite graphs, an application in textile engineering. Computers & operations research , Vol. 29 , 1 ( 2002 ), 13--31. Tore Gr\u00fcnert, Stefan Irnich, Hans-J\u00fcrgen Zimmermann, Markus Schneider, and Burkhard Wulfhorst. 2002. Finding all k-cliques in k-partite graphs, an application in textile engineering. Computers & operations research, Vol. 29, 1 (2002), 13--31."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492526"},{"key":"e_1_3_2_2_55_1","volume-title":"Cohesive Subgraph Detection in Large Bipartite Networks. In International Conference on Scientific and Statistical Database Management. 1--4.","author":"Hao Yang","year":"2020","unstructured":"Yang Hao , Mengqi Zhang , Xiaoyang Wang , and Chen Chen . 2020 . Cohesive Subgraph Detection in Large Bipartite Networks. In International Conference on Scientific and Statistical Database Management. 1--4. Yang Hao, Mengqi Zhang, Xiaoyang Wang, and Chen Chen. 2020. Cohesive Subgraph Detection in Large Bipartite Networks. In International Conference on Scientific and Statistical Database Management. 1--4."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/1024022"},{"key":"e_1_3_2_2_57_1","volume-title":"Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs. arXiv preprint arXiv:2008.04054","author":"He Yizhang","year":"2020","unstructured":"Yizhang He , Kai Wang , Wenjie Zhang , Xuemin Lin , and Ying Zhang . 2020. Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs. arXiv preprint arXiv:2008.04054 ( 2020 ). Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, and Ying Zhang. 2020. Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs. arXiv preprint arXiv:2008.04054 (2020)."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00072"},{"key":"e_1_3_2_2_59_1","volume-title":"Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs. In ACM Conference on Information and Knowledge Management (CIKM). 1241--1250","author":"Hu Jiafeng","year":"2016","unstructured":"Jiafeng Hu , Xiaowei Wu , Reynold Cheng , Siqiang Luo , and Yixiang Fang . 2016 . Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs. In ACM Conference on Information and Knowledge Management (CIKM). 1241--1250 . Jiafeng Hu, Xiaowei Wu, Reynold Cheng, Siqiang Luo, and Yixiang Fang. 2016. Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs. In ACM Conference on Information and Knowledge Management (CIKM). 1241--1250."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2730873"},{"key":"e_1_3_2_2_61_1","volume-title":"On Minimal Steiner Maximum-Connected Subgraph Queries","author":"Hu Jiafeng","unstructured":"Jiafeng Hu , Xiaowei Wu , Reynold Cheng , Siqiang Luo , and Yixiang Fang . 2017b. On Minimal Steiner Maximum-Connected Subgraph Queries . In IEEE Transactions on Knowledge and Data Engineering (TKDE) . 2455--2469. Jiafeng Hu, Xiaowei Wu, Reynold Cheng, Siqiang Luo, and Yixiang Fang. 2017b. On Minimal Steiner Maximum-Connected Subgraph Queries. In IEEE Transactions on Knowledge and Data Engineering (TKDE). 2455--2469."},{"key":"e_1_3_2_2_62_1","first-page":"29","article-title":"Attributed Community Analysis: Global and Ego-centric Views","volume":"39","author":"Huang Xin","year":"2016","unstructured":"Xin Huang , Hong Cheng , and Jeffrey Xu Yu . 2016 . Attributed Community Analysis: Global and Ego-centric Views . IEEE Data Eng. Bull. , Vol. 39 , 3 (2016), 29 -- 40 . Xin Huang, Hong Cheng, and Jeffrey Xu Yu. 2016. Attributed Community Analysis: Global and Ego-centric Views. IEEE Data Eng. Bull., Vol. 39, 3 (2016), 29--40.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_2_2_63_1","volume-title":"Laks VS Lakshmanan, and Jianliang Xu","author":"Huang Xin","year":"2019","unstructured":"Xin Huang , Laks VS Lakshmanan, and Jianliang Xu . 2019 . Community Search over Big Graphs .Morgan & Claypool Publishers . Xin Huang, Laks VS Lakshmanan, and Jianliang Xu. 2019. Community Search over Big Graphs .Morgan & Claypool Publishers."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939815"},{"key":"e_1_3_2_2_66_1","volume-title":"Mixed Integer Programming for Searching Maximum Quasi-Bicliques. In International Conference on Network Analysis. Springer, 19--35","author":"Ignatov Dmitry I","year":"2018","unstructured":"Dmitry I Ignatov , Polina Ivanova , and Albina Zamaletdinova . 2018 . Mixed Integer Programming for Searching Maximum Quasi-Bicliques. In International Conference on Network Analysis. Springer, 19--35 . Dmitry I Ignatov, Polina Ivanova, and Albina Zamaletdinova. 2018. Mixed Integer Programming for Searching Maximum Quasi-Bicliques. In International Conference on Network Analysis. Springer, 19--35."},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23525-7_39"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401969"},{"key":"e_1_3_2_2_69_1","volume-title":"VizCS: Online Searching and Visualizing Communities in Dynamic Graphs. In International Conference on Data Engineering (ICDE). 1585--1588","author":"Jiang Yuli","year":"2018","unstructured":"Yuli Jiang , Xin Huang , Hong Cheng , and Jeffrey Xu Yu . 2018 . VizCS: Online Searching and Visualizing Communities in Dynamic Graphs. In International Conference on Data Engineering (ICDE). 1585--1588 . Yuli Jiang, Xin Huang, Hong Cheng, and Jeffrey Xu Yu. 2018. VizCS: Online Searching and Visualizing Communities in Dynamic Graphs. In International Conference on Data Engineering (ICDE). 1585--1588."},{"key":"e_1_3_2_2_70_1","volume-title":"FAST: FPGA-based Subgraph Matching on Massive Graphs. arXiv preprint arXiv:2102.10768","author":"Jin Xin","year":"2021","unstructured":"Xin Jin , Zhengyi Yang , Xuemin Lin , Shiyu Yang , Lu Qin , and You Peng . 2021 . FAST: FPGA-based Subgraph Matching on Massive Graphs. arXiv preprint arXiv:2102.10768 (2021). Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, and You Peng. 2021. FAST: FPGA-based Subgraph Matching on Massive Graphs. arXiv preprint arXiv:2102.10768 (2021)."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341550"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00118"},{"key":"e_1_3_2_2_73_1","volume-title":"MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks. In International Conference on Data Engineering (ICDE). IEEE, 1722--1725","author":"Li Boxuan","year":"2020","unstructured":"Boxuan Li , Reynold Cheng , Jiafeng Hu , Yixiang Fang , Min Ou , Ruibang Luo , Kevin Chen-Chuan Chang , and Xuemin Lin . 2020 . MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks. In International Conference on Data Engineering (ICDE). IEEE, 1722--1725 . Boxuan Li, Reynold Cheng, Jiafeng Hu, Yixiang Fang, Min Ou, Ruibang Luo, Kevin Chen-Chuan Chang, and Xuemin Lin. 2020. MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks. In International Conference on Data Engineering (ICDE). IEEE, 1722--1725."},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190660"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104922"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407843"},{"key":"e_1_3_2_2_77_1","volume-title":"Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery","author":"Li Wentao","year":"2020","unstructured":"Wentao Li , Miao Qiao , Lu Qin , Ying Zhang , Lijun Chang , and Xuemin Lin . 2020 . Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery , New York, NY, USA, 1367--1381. Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin. 2020. Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery, New York, NY, USA, 1367--1381."},{"key":"e_1_3_2_2_78_1","volume-title":"Third International Conference on Advances in Information Mining and Management. 76--80","author":"Li Y","year":"2013","unstructured":"Y Li , T Kuboyama , and H Sakamoto . 2013 . Truss decomposition for extracting communities in bipartite graph . In Third International Conference on Advances in Information Mining and Management. 76--80 . Y Li, T Kuboyama, and H Sakamoto. 2013. Truss decomposition for extracting communities in bipartite graph. In Third International Conference on Advances in Information Mining and Management. 76--80."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850472"},{"key":"e_1_3_2_2_80_1","volume-title":"Global Reinforcement of Social Networks: The Anchored Coreness Problem. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery, 2211--2226","author":"Linghu Qingyuan","year":"2020","unstructured":"Qingyuan Linghu , Fan Zhang , Xuemin Lin , Wenjie Zhang , and Ying Zhang . 2020 . Global Reinforcement of Social Networks: The Anchored Coreness Problem. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery, 2211--2226 . Qingyuan Linghu, Fan Zhang, Xuemin Lin, Wenjie Zhang, and Ying Zhang. 2020. Global Reinforcement of Social Networks: The Anchored Coreness Problem. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery, 2211--2226."},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00606-9"},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34223-4_44"},{"key":"e_1_3_2_2_84_1","volume-title":"Efficient Community Search with Size Constraint. International Conference on Data Engineering (ICDE). IEEE.","author":"Liu Boge","year":"2021","unstructured":"Boge Liu , Fan Zhang , Wenjie Zhang , Xuemin Lin , and Ying Zhang . 2021 . Efficient Community Search with Size Constraint. International Conference on Data Engineering (ICDE). IEEE. Boge Liu, Fan Zhang, Wenjie Zhang, Xuemin Lin, and Ying Zhang. 2021. Efficient Community Search with Size Constraint. International Conference on Data Engineering (ICDE). IEEE."},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823728_42"},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2013.09.013"},{"key":"e_1_3_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380587"},{"key":"e_1_3_2_2_88_1","volume-title":"Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application","author":"Liu Xiaowen","year":"2008","unstructured":"Xiaowen Liu , Jinyan Li , and Lusheng Wang . 2008. Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application . IEEE\/ACM transactions on computational biology and bioinformatics, Vol. 7 , 2 ( 2008 ), 354--364. Xiaowen Liu, Jinyan Li, and Lusheng Wang. 2008. Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application. IEEE\/ACM transactions on computational biology and bioinformatics, Vol. 7, 2 (2008), 354--364."},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397234"},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_3_2_2_91_1","volume-title":"Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. In International Conference on Management of Data (SIGMOD). ACM, 1051--1066","author":"Ma Chenhao","year":"2020","unstructured":"Chenhao Ma , Yixiang Fang , Reynold Cheng , Laks VS Lakshmanan , Wenjie Zhang , and Xuemin Lin . 2020 . Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. In International Conference on Management of Data (SIGMOD). ACM, 1051--1066 . Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, Wenjie Zhang, and Xuemin Lin. 2020. Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. In International Conference on Management of Data (SIGMOD). ACM, 1051--1066."},{"key":"e_1_3_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07046-9_16"},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-012-0536-y"},{"key":"e_1_3_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033117.77257.41"},{"key":"e_1_3_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2016.2523997"},{"key":"e_1_3_2_2_97_1","volume-title":"Progressive Top-K Nearest Neighbors Search in Large Road Networks. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery","author":"Ouyang Dian","year":"2020","unstructured":"Dian Ouyang , Dong Wen , Lu Qin , Lijun Chang , Ying Zhang , and Xuemin Lin . 2020 . Progressive Top-K Nearest Neighbors Search in Large Road Networks. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery , New York, NY, USA, 1781--1795. Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin. 2020. Progressive Top-K Nearest Neighbors Search in Large Road Networks. In ACM International Conference on Management of Data (SIGMOD). Association for Computing Machinery, New York, NY, USA, 1781--1795."},{"key":"e_1_3_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1093\/gigascience\/giy014"},{"key":"e_1_3_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00333-0"},{"key":"e_1_3_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081898"},{"key":"e_1_3_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380753"},{"key":"e_1_3_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372720"},{"key":"e_1_3_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00110"},{"key":"e_1_3_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12010023"},{"key":"e_1_3_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_3_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.11.3304"},{"key":"e_1_3_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_2_108_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman . 1983. Network structure and minimum degree. Social networks , Vol. 5 , 3 ( 1983 ), 269--287. Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269--287."},{"key":"e_1_3_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974348.36"},{"key":"e_1_3_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598561"},{"key":"e_1_3_2_2_111_1","volume-title":"Parallel Algorithms for Butterfly Computations. arXiv preprint arXiv:1907.08607","author":"Shi Jessica","year":"2019","unstructured":"Jessica Shi and Julian Shun . 2019. Parallel Algorithms for Butterfly Computations. arXiv preprint arXiv:1907.08607 ( 2019 ). Jessica Shi and Julian Shun. 2019. Parallel Algorithms for Butterfly Computations. arXiv preprint arXiv:1907.08607 (2019)."},{"key":"e_1_3_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.5555\/1656479.1656483"},{"key":"e_1_3_2_2_113_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2018.00025"},{"key":"e_1_3_2_2_114_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_3_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167943.1167945"},{"key":"e_1_3_2_2_116_1","volume-title":"Gognn: Graph of graphs neural network for predicting structured entity interactions.","author":"Wang Hanchen","year":"2020","unstructured":"Hanchen Wang , Defu Lian , Ying Zhang , Lu Qin , and Xuemin Lin . 2020 . Gognn: Graph of graphs neural network for predicting structured entity interactions. (2020), 1317--1323. Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, and Xuemin Lin. 2020. Gognn: Graph of graphs neural network for predicting structured entity interactions. (2020), 1317--1323."},{"key":"e_1_3_2_2_117_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_2_118_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00030"},{"key":"e_1_3_2_2_119_1","volume-title":"Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. The VLDB Journal","author":"Wang Kai","year":"2021","unstructured":"Kai Wang , Xuemin Lin , Lu Qin , Wenjie Zhang , and Zhang Ying . 2021. Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. The VLDB Journal ( 2021 ), 1--24. Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, and Zhang Ying. 2021. Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. The VLDB Journal (2021), 1--24."},{"key":"e_1_3_2_2_120_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"key":"e_1_3_2_2_121_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"e_1_3_2_2_122_1","volume-title":"2020 b. Efficient Radius-bounded Community Search in Geo-social Networks","author":"Wang Kai","year":"2020","unstructured":"Kai Wang , Shuting Wang , Xin Cao , and Lu Qin . 2020 b. Efficient Radius-bounded Community Search in Geo-social Networks . IEEE Transactions on Knowledge and Data Engineering (TKDE) ( 2020 ). Kai Wang, Shuting Wang, Xin Cao, and Lu Qin. 2020 b. Efficient Radius-bounded Community Search in Geo-social Networks. IEEE Transactions on Knowledge and Data Engineering (TKDE) (2020)."},{"key":"e_1_3_2_2_123_1","volume-title":"Efficient and Effective Community Search on Large-scale Bipartite Graphs. International Conference on Data Engineering (ICDE)","author":"Wang Kai","year":"2021","unstructured":"Kai Wang , Wenjie Zhang , Xuemin Lin , Ying Zhang , Lu Qin , and Yuting Zhang . 2021 . Efficient and Effective Community Search on Large-scale Bipartite Graphs. International Conference on Data Engineering (ICDE) (2021). Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Lu Qin, and Yuting Zhang. 2021. Efficient and Effective Community Search on Large-scale Bipartite Graphs. International Conference on Data Engineering (ICDE) (2021)."},{"key":"e_1_3_2_2_124_1","volume-title":"Simplifying Weighted Heterogeneous networks by extracting h-Structure via s-Degree. Scientific reports","author":"Wang Ruby W","year":"2019","unstructured":"Ruby W Wang and Y Ye Fred . 2019. Simplifying Weighted Heterogeneous networks by extracting h-Structure via s-Degree. Scientific reports , Vol. 9 , 1 ( 2019 ), 1--8. Ruby W Wang and Y Ye Fred. 2019. Simplifying Weighted Heterogeneous networks by extracting h-Structure via s-Degree. Scientific reports, Vol. 9, 1 (2019), 1--8."},{"key":"e_1_3_2_2_125_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.012"},{"key":"e_1_3_2_2_126_1","volume-title":"Identifying optimal incomplete phylogenetic data sets from sequence databases. Molecular phylogenetics and evolution","author":"Yan Changhui","year":"2005","unstructured":"Changhui Yan , J Gordon Burleigh , and Oliver Eulenstein . 2005. Identifying optimal incomplete phylogenetic data sets from sequence databases. Molecular phylogenetics and evolution , Vol. 35 , 3 ( 2005 ), 528--535. Changhui Yan, J Gordon Burleigh, and Oliver Eulenstein. 2005. Identifying optimal incomplete phylogenetic data sets from sequence databases. Molecular phylogenetics and evolution, Vol. 35, 3 (2005), 528--535."},{"key":"e_1_3_2_2_127_1","volume-title":"Effective and Efficient Truss Computation Over Large Heterogeneous Information Networks. In International Conference on Data Engineering (ICDE). IEEE, 901--912","author":"Yang Yixing","year":"2020","unstructured":"Yixing Yang , Yixiang Fang , Xuemin Lin , and Wenjie Zhang . 2020 . Effective and Efficient Truss Computation Over Large Heterogeneous Information Networks. In International Conference on Data Engineering (ICDE). IEEE, 901--912 . Yixing Yang, Yixiang Fang, Xuemin Lin, and Wenjie Zhang. 2020. Effective and Efficient Truss Computation Over Large Heterogeneous Information Networks. In International Conference on Data Engineering (ICDE). IEEE, 901--912."},{"key":"e_1_3_2_2_128_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447702"},{"key":"e_1_3_2_2_129_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"e_1_3_2_2_130_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"},{"key":"e_1_3_2_2_131_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904484"},{"key":"e_1_3_2_2_132_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0451-4"},{"key":"e_1_3_2_2_133_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"e_1_3_2_2_134_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150506"},{"key":"e_1_3_2_2_135_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91452-7_28"},{"key":"e_1_3_2_2_136_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055332"},{"key":"e_1_3_2_2_137_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"e_1_3_2_2_138_1","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115406"},{"key":"e_1_3_2_2_139_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00057"},{"key":"e_1_3_2_2_140_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00572-x"},{"key":"e_1_3_2_2_141_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00674-0"},{"key":"e_1_3_2_2_142_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00819-6"},{"key":"e_1_3_2_2_143_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"},{"key":"e_1_3_2_2_144_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","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 , Vol. 15 , 1 ( 2014 ), 110. 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, Vol. 15, 1 (2014), 110."},{"key":"e_1_3_2_2_145_1","volume-title":"Hierarchical Decomposition of Big Graphs. In International Conference on Data Engineering (ICDE). IEEE","author":"Zhang Ying","year":"2019","unstructured":"Ying Zhang , Lu Qin , Fan Zhang , and Wenjie Zhang . 2019 . Hierarchical Decomposition of Big Graphs. In International Conference on Data Engineering (ICDE). IEEE , 2064--2067. Ying Zhang, Lu Qin, Fan Zhang, and Wenjie Zhang. 2019. Hierarchical Decomposition of Big Graphs. In International Conference on Data Engineering (ICDE). IEEE, 2064--2067."},{"key":"e_1_3_2_2_146_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00045"},{"key":"e_1_3_2_2_147_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSC.2017.80"},{"key":"e_1_3_2_2_148_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407846"},{"key":"e_1_3_2_2_149_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.09.017"},{"key":"e_1_3_2_2_150_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.03.010"},{"key":"e_1_3_2_2_151_1","volume-title":"K-Core Maximization: An Edge Addition Approach. In International Joint Conference on Artificial Intelligence (IJCAI). 4867--4873","author":"Zhou Zhongxin","year":"2019","unstructured":"Zhongxin Zhou , Fan Zhang , Xuemin Lin , Wenjie Zhang , and Chen Chen . 2019 . K-Core Maximization: An Edge Addition Approach. In International Joint Conference on Artificial Intelligence (IJCAI). 4867--4873 . Zhongxin Zhou, Fan Zhang, Xuemin Lin, Wenjie Zhang, and Chen Chen. 2019. K-Core Maximization: An Edge Addition Approach. In International Joint Conference on Artificial Intelligence (IJCAI). 4867--4873."},{"key":"e_1_3_2_2_152_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00069"},{"key":"e_1_3_2_2_153_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00542-3"},{"key":"e_1_3_2_2_154_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32049-6_14"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:04Z","timestamp":1750195504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":154,"alternative-id":["10.1145\/3448016.3457538","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457538","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}