{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:40:10Z","timestamp":1775230810721,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T00:00:00Z","timestamp":1624665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11280-021-00914-2","type":"journal-article","created":{"date-parts":[[2021,6,26]],"date-time":"2021-06-26T12:02:40Z","timestamp":1624708960000},"page":"741-761","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient critical relationships identification in bipartite networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiuyu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renjie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xijuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,26]]},"reference":[{"key":"914_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Batagelj, V., Fu, X., Hong, S., Merrick, D., Mrvar, A.: Visualisation and analysis of the internet movie database. In: APVIS (2007)","DOI":"10.1109\/APVIS.2007.329304"},{"key":"914_CR2","doi-asserted-by":"crossref","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Error and attack tolerance of complex networks. Nature (2000)","DOI":"10.1038\/35019019"},{"key":"914_CR3","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 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"914_CR4","doi-asserted-by":"crossref","unstructured":"Bola, M., Sabel, B.A.: Dynamic reorganization of brain functional networks during cognition. Neuroimage (2015)","DOI":"10.1101\/012922"},{"key":"914_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Khan, A., Severini, L.: Distance-generalized core decomposition. In: SIGMOD (2019)","DOI":"10.1145\/3299869.3324962"},{"key":"914_CR6","doi-asserted-by":"crossref","unstructured":"Borgatti, S.P., Everett, M.G.: Network analysis of 2-mode data Social networks (1997)","DOI":"10.1016\/S0378-8733(96)00301-2"},{"key":"914_CR7","doi-asserted-by":"crossref","unstructured":"Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., Shir, E.: A model of internet topology using k-shell decomposition. In: Proceedings of the national academy of sciences (2007)","DOI":"10.1073\/pnas.0701175104"},{"key":"914_CR8","doi-asserted-by":"crossref","unstructured":"Cerin\u0161ek, M., Batagelj, V.: Generalized two-mode cores. Social Networks (2015)","DOI":"10.1016\/j.socnet.2015.04.001"},{"key":"914_CR9","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"914_CR10","doi-asserted-by":"crossref","unstructured":"Chen, C., Tong, H., Prakash, B.A., Eliassi-Rad, T., Faloutsos, M., Faloutsos, C.: Eigen-optimization on large graphs by edge manipulation. TKDD (2016)","DOI":"10.1145\/2903148"},{"key":"914_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Fu, A.W., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks by h*-graph. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807217"},{"key":"914_CR12","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha-beta-core. In: CIKM (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"914_CR13","doi-asserted-by":"crossref","unstructured":"Hochbaum, D. S.: Approximating clique and biclique problems. J. Alg. (1998)","DOI":"10.1006\/jagm.1998.0964"},{"key":"914_CR14","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: FRAUDAR: bounding graph fraud in the face of camouflage. In: SIGKDD (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"914_CR15","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: SIGMOD (2014)","DOI":"10.1145\/2588555.2610495"},{"key":"914_CR16","doi-asserted-by":"crossref","unstructured":"Laishram, R., Sariy\u00fcce, A.E., Eliassi-Rad, T., Pinar, A., Soundarajan, S.: Residual core maximization: An efficient algorithm for maximizing the size of the k-core. In: SDM (2020)","DOI":"10.1137\/1.9781611976236.37"},{"key":"914_CR17","doi-asserted-by":"crossref","unstructured":"Lehmann, S., Schwartz, M., Hansen, L.K.: Biclique communities. Phys. Rev. E (2008)","DOI":"10.1103\/PhysRevE.78.016108"},{"key":"914_CR18","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (\u03b1, \u03b2)-core computation: An index-based approach. In: WWW (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"914_CR19","doi-asserted-by":"crossref","unstructured":"Liu, G., Sim, K., Li, J.: Efficient mining of large maximal bicliques. In: DaWaK (2006)","DOI":"10.1007\/11823728_42"},{"key":"914_CR20","doi-asserted-by":"crossref","unstructured":"Robins, G., Alexander, M.: Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Comput. Math. Organ. Theory (2004)","DOI":"10.1023\/B:CMOT.0000032580.12184.c0"},{"key":"914_CR21","doi-asserted-by":"crossref","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Netw. (1983)","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"914_CR22","doi-asserted-by":"crossref","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. TKDE (2020)","DOI":"10.1109\/TKDE.2020.3047224"},{"key":"914_CR23","doi-asserted-by":"crossref","unstructured":"Sun, R., Zhu, Q., Chen, C., Wang, X., Zhang, Y., Wang, X.: Discovering cliques in signed networks based on balance theory. In: DASFAA, pp. 666\u2013674 (2020)","DOI":"10.1007\/978-3-030-59416-9_43"},{"key":"914_CR24","doi-asserted-by":"crossref","unstructured":"Wang, J., De Vries, A.P., Reinders, M.J.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: SIGIR (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"914_CR25","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. VLDB (2019)","DOI":"10.14778\/3339490.3339497"},{"key":"914_CR26","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 (2020)","DOI":"10.1007\/s00778-021-00658-5"},{"issue":"3","key":"914_CR27","first-page":"599","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. TKDE 29(3), 599\u2013612 (2016)","journal-title":"TKDE"},{"issue":"2","key":"914_CR28","first-page":"243","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: A novel scalable method for influence maximization. TKDE 29(2), 243\u2013256 (2016)","journal-title":"TKDE"},{"key":"914_CR29","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. In: APWeb-WAIM (2020)","DOI":"10.1007\/978-3-030-60259-8_7"},{"key":"914_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, F., Li, C., Zhang, Y., Qin, L., Zhang, W.: Finding critical users in social communities: The collapsed core and truss problems. TKDE (2020)","DOI":"10.1109\/TKDE.2018.2880976"},{"key":"914_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, J., Sun, R., Zhu, Q., Wang, X., Chen, C.: Community identification in signed networks: A k-truss based model. In: CIKM, pp. 2321\u20132324 (2020)","DOI":"10.1145\/3340531.3412117"},{"key":"914_CR32","doi-asserted-by":"crossref","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: EDBT (2012)","DOI":"10.1145\/2247596.2247652"},{"key":"914_CR33","doi-asserted-by":"crossref","unstructured":"Zhu, W., Chen, C., Wang, X., Lin, X.: K-core minimization: An edge manipulation approach. In: CIKM (2018)","DOI":"10.1145\/3269206.3269254"},{"key":"914_CR34","doi-asserted-by":"crossref","unstructured":"Zhu, W., Zhang, M., Chen, C., Wang, X., Zhang, F., Lin, X.: Pivotal relationship identification: The k-truss minimization problem. In: IJCAI (2019)","DOI":"10.24963\/ijcai.2019\/677"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00914-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-021-00914-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-021-00914-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T11:18:45Z","timestamp":1646133525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-021-00914-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,26]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["914"],"URL":"https:\/\/doi.org\/10.1007\/s11280-021-00914-2","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,26]]},"assertion":[{"value":"1 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}