{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:00:42Z","timestamp":1772913642394,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819777068","type":"print"},{"value":"9789819777075","type":"electronic"}],"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-7707-5_18","type":"book-chapter","created":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T15:04:02Z","timestamp":1726499042000},"page":"203-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient p-Biclique Query on\u00a0Large Bipartite Networks"],"prefix":"10.1007","author":[{"given":"Zhizhi","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deming","family":"Chu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"key":"18_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Beutel, A., Xu, W., Guruswami, V., Palow, C., Faloutsos, C.: Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In: WWW, pp. 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"issue":"9","key":"18_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. CACM 16(9), 575\u2013577 (1973)","journal-title":"CACM"},{"issue":"8","key":"18_CR4","first-page":"1559","volume":"15","author":"L Chen","year":"2022","unstructured":"Chen, L., Liu, C., Zhou, R., Xu, J., Li, J.: Efficient maximal biclique enumeration for large sparse bipartite graphs. PVLDB 15(8), 1559\u20131571 (2022)","journal-title":"PVLDB"},{"issue":"4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng, J., Ke, Y., Fu, A.W.C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. TODS 36(4), 1\u201334 (2011)","journal-title":"TODS"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chu, D., et al.: Finding the best k in core decomposition: a time and space optimal solution. In: ICDE, pp. 685\u2013696. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00065"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Chu, D., et al.: Discovering and maintaining the best k in core decomposition. TKDE (2024)","DOI":"10.1109\/TKDE.2024.3389989"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chu, D., Zhang, F., Zhang, W., Lin, X., Zhang, Y.: Hierarchical core decomposition in parallel: from construction to subgraph search. In: ICDE, pp. 1138\u20131151. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00090"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3654943","volume":"2","author":"D Chu","year":"2024","unstructured":"Chu, D., Zhang, F., Zhang, W., Zhang, Y., Lin, X.: Graph summarization: compactness meets efficiency. Proc. ACM Manag. Data 2(3), 1\u201326 (2024)","journal-title":"Proc. ACM Manag. Data"},{"issue":"3.1","key":"18_CR10","first-page":"1","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Natl. Secur. Agency Tech. Rep. 16(3.1), 1\u201329 (2008)","journal-title":"Natl. Secur. Agency Tech. Rep."},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TMSCS.2018.2802920","volume":"4","author":"A Das","year":"2018","unstructured":"Das, A., Tirthapura, S.: Incremental maintenance of maximal bicliques in a dynamic bipartite graph. IEEE Trans. Multi-Scale Comput. Syst. 4(3), 231\u2013242 (2018)","journal-title":"IEEE Trans. Multi-Scale Comput. Syst."},{"issue":"1","key":"18_CR12","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single pc. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation: an index-based approach. In: WWW, pp. 1130\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Liu, J., Wang, W.: Op-cluster: clustering by tendency in high dimensional space. In: ICDM, pp. 187\u2013194. IEEE (2003)","DOI":"10.1109\/ICDM.2003.1250919"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Luo, W., Li, K., Zhou, X., Gao, Y., Li, K.: Maximum biplex search over bipartite graphs. In: ICDE, pp. 898\u2013910. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00072"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. PVLDB (2020)","DOI":"10.14778\/3397230.3397234"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1111\/1467-937X.00121","volume":"67","author":"S Morris","year":"2000","unstructured":"Morris, S.: Contagion. Rev. Econ. Stud. 67(1), 57\u201378 (2000)","journal-title":"Rev. Econ. Stud."},{"issue":"4","key":"18_CR18","first-page":"420","volume":"11","author":"S Sahu","year":"2017","unstructured":"Sahu, S., Mhedhbi, A., Salihoglu, S., Lin, J., \u00d6zsu, M.T.: The ubiquity of large graphs and surprising challenges of graph processing. PVLDB 11(4), 420\u2013431 (2017)","journal-title":"PVLDB"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-981-99-6222-8_14","volume-title":"International Conference on Web Information Systems and Applications","author":"K Shu","year":"2023","unstructured":"Shu, K., Liang, Q., Guo, H., Zhang, F., Wang, K., Yuan, L.: Finding introverted cores in bipartite graphs. In: Yuan, L., Yang, S., Li, R., Kanoulas, E., Zhao, X. (eds.) WISA 2023. LNCS, vol. 14094, pp. 162\u2013170. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-981-99-6222-8_14"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Sun, R., Wu, Y., Chen, C., Wang, X., Zhang, W., Lin, X.: Maximal balanced signed biclique enumeration in signed bipartite graphs. In: ICDE, pp. 1887\u20131899. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00187"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9) (2012)","DOI":"10.14778\/2311906.2311909"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: ICDE, pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Qin, L., Zhou, A.: Efficient personalized maximum biclique search. In: ICDE, pp. 498\u2013511. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00042"},{"key":"18_CR24","first-page":"11165","volume":"35","author":"K Wang","year":"2023","unstructured":"Wang, K., Zhao, G., Zhang, W., Lin, X., Zhang, Y., He, Y., Li, C.: Cohesive subgraph discovery over uncertain bipartite graphs. TKDE 35, 11165\u201311179 (2023)","journal-title":"TKDE"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yuan, L., Chen, Z., Zhang, W., Lin, X., Liu, Q.: Towards efficient shortest path counting on billion-scale graphs. In: ICDE, pp. 2579\u20132592. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00198"},{"issue":"6","key":"18_CR26","first-page":"1297","volume":"17","author":"J Xie","year":"2024","unstructured":"Xie, J., Chen, Z., Chu, D., Zhang, F., Lin, X., Tian, Z.: Influence maximization via vertex countering. PVLDB 17(6), 1297\u20131309 (2024)","journal-title":"PVLDB"},{"issue":"11","key":"18_CR27","first-page":"3085","volume":"15","author":"K Yao","year":"2022","unstructured":"Yao, K., Chang, L., Yu, J.X.: Identifying similar-bicliques in bipartite graphs. PVLDB 15(11), 3085\u20133097 (2022)","journal-title":"PVLDB"},{"issue":"1","key":"18_CR28","first-page":"824","volume":"35","author":"K Yu","year":"2021","unstructured":"Yu, K., Long, C., Deepak, P., Chakraborty, T.: On efficient large maximal biplex discovery. TKDE 35(1), 824\u2013829 (2021)","journal-title":"TKDE"},{"issue":"2","key":"18_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, C., et al.: Exploring finer granularity within the cores: efficient (k, p)-core computation. In: ICDE, pp. 181\u2013192. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00023"},{"key":"18_CR31","first-page":"1","volume":"15","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Phillips, C.A., Rogers, G.L., Baker, E.J., Chesler, E.J., Langston, M.A.: On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. Bioinformatics 15, 1\u201318 (2014)","journal-title":"Bioinformatics"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, G., Wang, K., Zhang, W., Lin, X., Zhang, Y., He, Y.: Efficient computation of cohesive subgraphs in uncertain bipartite graphs. In: ICDE, pp. 2333\u20132345. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00220"},{"issue":"2","key":"18_CR33","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11280-021-00907-1","volume":"25","author":"Z Zhou","year":"2022","unstructured":"Zhou, Z., Zhang, W., Zhang, F., Chu, D., Li, B.: Vek: a vertex-oriented approach for edge k-core problem. World Wide Web 25(2), 723\u2013740 (2022)","journal-title":"World Wide Web"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","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, X.S., Xiong, H. (eds.) DASFAA 2016. LNCS, vol. 9643, pp. 218\u2013233. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32049-6_14"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7707-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T15:07:25Z","timestamp":1726499245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7707-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819777068","9789819777075"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7707-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yinchuan","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":"1 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/web\/html7\/index.html?globalId=m1216704987858604032171012667439&type=1","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}