{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:57:59Z","timestamp":1742918279106,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819772377"},{"type":"electronic","value":"9789819772384"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7238-4_20","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"308-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient $$(\\alpha , \\beta , \\gamma )$$-Core Search in\u00a0Bipartite Graphs Based on\u00a0Bi-Triangles"],"prefix":"10.1007","author":[{"given":"Chuanyu","family":"Zong","sequence":"first","affiliation":[]},{"given":"Wenyang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Meng-xiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM \u201917, Association for Computing Machinery, New York, NY, USA, pp. 2047\u20132050 (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-319-32049-6_14","volume-title":"Database Systems for Advanced Applications","author":"Z Zou","year":"2016","unstructured":"Zou, Z.: Bitruss decomposition of bipartite graphs. In: Navathe, S.B., Wu, W., Shekhar, S., Du, X., Wang, S.X., Xiong, H. (eds.) Database Systems for Advanced Applications, pp. 218\u2013233. Springer International Publishing, Cham (2016)"},{"issue":"6","key":"20_CR3","doi-asserted-by":"publisher","first-page":"984","DOI":"10.14778\/3447689.3447702","volume":"14","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Fang, Y., Orlowska, M.E., Zhang, W., Lin, X.: Efficient bi-triangle counting for large bipartite networks. Proc. VLDB Endowment 14(6), 984\u2013996 (2021)","journal-title":"Proc. VLDB Endowment"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2021.04.027","volume":"572","author":"Y He","year":"2021","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inf. Sci. 572, 277\u2013296 (2021)","journal-title":"Inf. Sci."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201914, Association for Computing Machinery, New York, NY, USA, pp. 991\u20131002 (2014)","DOI":"10.1145\/2588555.2612179"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"757","DOI":"10.14778\/3446095.3446099","volume":"14","author":"Z Lin","year":"2021","unstructured":"Lin, Z., Zhang, F., Lin, X., Zhang, W., Tian, Z.: Hierarchical core maintenance on large dynamic graphs. Proc. VLDB Endowment 14(5), 757\u2013770 (2021)","journal-title":"Proc. VLDB Endowment"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201914, Association for Computing Machinery, New York, NY, USA, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Li, S.: Discovering hierarchy of bipartite graphs with cohesive subgraphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 2291\u20132305. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00217"},{"issue":"03","key":"20_CR10","first-page":"2471","volume":"35","author":"K Wang","year":"2023","unstructured":"Wang, K., Zhang, W., Zhang, Y., Qin, L., Zhang, Y.: Discovering significant communities on bipartite graphs: an index-based approach. IEEE Trans. Knowl. Data Eng. 35(03), 2471\u20132485 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119511","volume":"647","author":"K Zhou","year":"2023","unstructured":"Zhou, K., Xin, J., Chen, J., Zhang, X., Wang, B., Wang, Z.: Effective and efficient community search with size constraint on bipartite graphs. Inf. Sci. 647, 119511 (2023)","journal-title":"Inf. Sci."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Bai, W., Chen, Y., Wu, D., Huang, Z., Zhou, Y., Xu, C.: Generalized core maintenance of dynamic bipartite graphs. Data Min. Knowl. Disc., 1\u201331 (2022)","DOI":"10.1007\/s10618-021-00805-0"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Liu, Q., Liao, X., Huang, X., Xu, J., Gao, Y.: Distributed ($$\\alpha $$, $$\\beta $$)-core decomposition over bipartite graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 909\u2013921. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00075"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Efficient reinforcement of bipartite networks at billion scale. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 446\u2013458 (2022).https:\/\/doi.org\/10.1109\/ICDE53745.2022.00038","DOI":"10.1109\/ICDE53745.2022.00038"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00778-022-00746-0","volume":"32","author":"K Wang","year":"2023","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 32(2), 257\u2013281 (2023)","journal-title":"VLDB J."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Q., Zhao, M., Huang, X., Xu, J., Gao, Y.: Truss-based community search over large directed graphs. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2183\u20132197 (2020)","DOI":"10.1145\/3318464.3380587"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7238-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:15:31Z","timestamp":1724775331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7238-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772377","9789819772384"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7238-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}