{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T22:25:48Z","timestamp":1790115948796,"version":"4.0.1"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:00:00Z","timestamp":1583280000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s00778-020-00606-9","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T00:50:56Z","timestamp":1583283056000},"page":"1075-1099","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":86,"title":["Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Boge","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9896-0805","authenticated-orcid":false,"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"issue":"3","key":"606_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.joi.2012.01.002","volume":"6","author":"A Abbasi","year":"2012","unstructured":"Abbasi, A., Hossain, L., Leydesdorff, L.: Betweenness centrality as a driver of preferential attachment in the evolution of research collaboration networks. J. Informetr. 6(3), 403\u2013412 (2012)","journal-title":"J. Informetr."},{"key":"606_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Batagelj, V., Fu, X., Hong, S.-H., Merrick, D., Mrvar, A.: Visualisation and analysis of the internet movie database. In: Proceedings of APVIS, pp 17\u201324 (2007)","DOI":"10.1109\/APVIS.2007.329304"},{"key":"606_CR3","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"SG Aksoy","year":"2017","unstructured":"Aksoy, S.G., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. J. Complex Netw. 5, 581\u2013603 (2017)","journal-title":"J. Complex Netw."},{"key":"606_CR4","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: k-core decomposition: a tool for the visualization of large scale networks. arXiv preprint arXiv:cs\/0504107 (2005)"},{"issue":"1","key":"606_CR5","doi-asserted-by":"publisher","first-page":"754","DOI":"10.14778\/1687627.1687713","volume":"2","author":"S Amer-Yahia","year":"2009","unstructured":"Amer-Yahia, S., Roy, S.B., Chawlat, A., Das, G., Yu, C.: Group recommendation: semantics and efficiency. Proc. VLDB 2(1), 754\u2013765 (2009)","journal-title":"Proc. VLDB"},{"issue":"1","key":"606_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformat. 4(1), 2 (2003)","journal-title":"BMC Bioinformat."},{"issue":"5439","key":"606_CR7","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"606_CR8","unstructured":"Batagelj, V., Zaversnik, M.: An o (m) algorithm for cores decomposition of networks. arXiv preprint arXiv:cs\/0310049 (2003)"},{"key":"606_CR9","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: Proceedings of WWW, pp 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"606_CR10","doi-asserted-by":"crossref","unstructured":"Carvalho, L.A.M.C., Macedo, H.T.: Users\u2019 satisfaction in recommendation systems for groups: an approach based on noncooperative games. In: Proceedings of WWW, pp 951\u2013958 (2013)","DOI":"10.1145\/2487788.2488090"},{"key":"606_CR11","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.socnet.2015.04.001","volume":"42","author":"M Cerin\u0161ek","year":"2015","unstructured":"Cerin\u0161ek, M., Batagelj, V.: Generalized two-mode cores. Soc. Netw. 42, 80\u201387 (2015)","journal-title":"Soc. Netw."},{"key":"606_CR12","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Blelloch, G.E., Shun, J.: Theoretically efficient parallel graph algorithms can be fast and scalable. In: Proceedings of SPAA, pp 393\u2013404 (2018)","DOI":"10.1145\/3210377.3210414"},{"key":"606_CR13","doi-asserted-by":"crossref","unstructured":"Ding, D., Li, H., Huang, Z., Mamoulis, N.: Efficient fault-tolerant group recommendation using alpha\u2013beta\u2013core. In: Proceedings of CIKM, pp 2047\u20132050 (2017)","DOI":"10.1145\/3132847.3133130"},{"key":"606_CR14","doi-asserted-by":"crossref","unstructured":"Dormann, C.F., Fr\u00fcnd, J., Bl\u00fcthgen, N., Gruber, B.: Indices, graphs and null models: analyzing bipartite ecological networks. Open Ecol. J. 2(1) (2009)","DOI":"10.2174\/1874213000902010007"},{"key":"606_CR15","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Sozio, M.: Efficient densest subgraph computation in evolving graphs. In: Proceedings of WWW, pp 300\u2013310 (2015)","DOI":"10.1145\/2736277.2741638"},{"key":"606_CR16","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Luo, J., Tan, Z., Wang, X., Wu, Y.: Incremental graph pattern matching. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201911, ACM, pp 925\u2013936 (2011)","DOI":"10.1145\/1989323.1989420"},{"issue":"6","key":"606_CR17","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00778-017-0482-5","volume":"26","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Chen, Y., Luo, S., Hu, J.: Effective and efficient attributed community search. VLDB J. 26(6), 803\u2013828 (2017)","journal-title":"VLDB J."},{"issue":"6","key":"606_CR18","doi-asserted-by":"publisher","first-page":"709","DOI":"10.14778\/3055330.3055337","volume":"10","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Li, X., Luo, S., Hu, J.: Effective community search over large spatial graphs. Proc. VLDB Endow. 10(6), 709\u2013720 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"606_CR19","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/2994509.2994538","volume":"9","author":"Y Fang","year":"2016","unstructured":"Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proc. VLDB Endow. 9(12), 1233\u20131244 (2016)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"606_CR20","first-page":"783","volume":"31","author":"Y Fang","year":"2018","unstructured":"Fang, Y., Wang, Z., Cheng, R., Li, X., Luo, S., Hu, J., Chen, X.: On spatial-aware community search. IEEE TKDE 31(4), 783\u2013798 (2018)","journal-title":"IEEE TKDE"},{"issue":"11","key":"606_CR21","first-page":"2093","volume":"31","author":"Y Fang","year":"2018","unstructured":"Fang, Y., Wang, Z., Cheng, R., Wang, H., Hu, J.: Effective and efficient community search over large directed graphs. IEEE TKDE 31(11), 2093\u20132107 (2018)","journal-title":"IEEE TKDE"},{"issue":"11","key":"606_CR22","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.14778\/3342263.3342645","volume":"12","author":"Y Fang","year":"2019","unstructured":"Fang, Y., Yu, K., Cheng, R., Lakshmanan, L.V., Lin, X.: Efficient algorithms for densest subgraph discovery. Proc. VLDB Endow. 12(11), 1719\u20131732 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"606_CR23","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10619-018-7232-6","volume":"36","author":"X Feng","year":"2018","unstructured":"Feng, X., Chang, L., Lin, X., Qin, L., Zhang, W., Yuan, L.: Distributed computing connected components with linear communication cost. Distrib. Parallel Databases 36(3), 555\u2013592 (2018)","journal-title":"Distrib. Parallel Databases"},{"key":"606_CR24","doi-asserted-by":"crossref","unstructured":"Gartrell, M., Xing, X., Lv, Q., Beach, A., Han, R., Mishra, S., Seada, K.: Enhancing group recommendation by incorporating social relationship interactions. In: Proceedings of the 16th ACM International Conference on Supporting Group Work, ACM, pp 97\u2013106 (2010)","DOI":"10.1145\/1880071.1880087"},{"key":"606_CR25","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: measuring collaboration of directed graphs based on degeneracy. In: Proceedings of ICDM, pp 201\u2013210 (2011)","DOI":"10.1109\/ICDM.2011.46"},{"key":"606_CR26","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: Evaluating cooperation in communities with the k-core structure. In: Proceedings of ASONAM, IEEE, pp 87\u201393 (2011)","DOI":"10.1109\/ASONAM.2011.65"},{"key":"606_CR27","doi-asserted-by":"crossref","unstructured":"Gorla, J., Lathia, N., Robertson, S., Wang, J.: Probabilistic group recommendation via information matching. In: Proceedings of WWW, pp 495\u2013504 (2013)","DOI":"10.1145\/2488388.2488432"},{"issue":"5","key":"606_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ipl.2004.03.007","volume":"90","author":"J-L Guillaume","year":"2004","unstructured":"Guillaume, J.-L., Latapy, M.: Bipartite structure of all complex networks. Inf. Process. Lett. 90(5), 215\u2013221 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"606_CR29","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.physa.2006.04.047","volume":"371","author":"J-L Guillaume","year":"2006","unstructured":"Guillaume, J.-L., Latapy, M.: Bipartite graphs as models of complex networks. Phys. A Stat. Mech. Appl. 371(2), 795\u2013813 (2006)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"606_CR30","doi-asserted-by":"crossref","unstructured":"Gunnemann, S., Muller, E., Raubach, S., Seidl, T.: Flexible fault tolerant subspace clustering for data with missing values. In: Proceedings of ICDM, pp 231\u2013240 (2011)","DOI":"10.1109\/ICDM.2011.70"},{"issue":"1","key":"606_CR31","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.1998.0964","volume":"29","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithms 29(1), 174\u2013200 (1998)","journal-title":"J. Algorithms"},{"key":"606_CR32","unstructured":"Kannan, R., Tetali, P., Vempala, S.: Simple Markov\u2013Chain algorithms for generating bipartite graphs and tournaments. In: Proceedings of SODA, pp 193\u2013200 (1997)"},{"issue":"10","key":"606_CR33","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1016\/j.ins.2010.07.007","volume":"181","author":"M Kaytoue","year":"2011","unstructured":"Kaytoue, M., Kuznetsov, S.O., Napoli, A., Duplessis, S.: Mining gene expression data with pattern structures in formal concept analysis. Inf. Sci. 181(10), 1989\u20132001 (2011)","journal-title":"Inf. Sci."},{"issue":"1","key":"606_CR34","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2850469.2850471","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. Proc. VLDB Endow. 9(1), 13\u201323 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"606_CR35","doi-asserted-by":"publisher","first-page":"C424","DOI":"10.1137\/130914218","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T., Seshadhri, C.: A scalable generative graph model with community structure. SIAM J. Sci. Comput. 36(5), C424\u2013C452 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"606_CR36","first-page":"337","volume-title":"Structure and evolution of online social networks","author":"R Kumar","year":"2010","unstructured":"Kumar, R., Novak, J., Tomkins, A.: Structure and evolution of online social networks, pp. 337\u2013357. Springer, New York (2010)"},{"key":"606_CR37","doi-asserted-by":"crossref","unstructured":"Ley, M.: The DBLP computer science bibliography: evolution, research issues, perspectives. In: Proc. Int. SPIRE, pp 1\u201310 (2002)","DOI":"10.1007\/3-540-45735-6_1"},{"key":"606_CR38","doi-asserted-by":"crossref","unstructured":"Li, J., Sim, K., Liu, G., Wong, L.: Maximal quasi-bicliques with balanced noise tolerance: concepts and co-clustering applications. In: Proceedings of ICDM, pp 72\u201383 (2008)","DOI":"10.1137\/1.9781611972788.7"},{"key":"606_CR39","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","volume":"1","author":"G Linden","year":"2003","unstructured":"Linden, G., Smith, B., York, J.: Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Comput. 1, 76\u201380 (2003)","journal-title":"IEEE Internet Comput."},{"key":"606_CR40","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: Proceedings of WWW, pp 1130\u20131141 (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"606_CR41","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, C., Zhang, W., Lin, X.: Corecube: core decomposition in multilayer graphs. In: WISE, Springer, pp 694\u2013710. (2019)","DOI":"10.1007\/978-3-030-34223-4_44"},{"issue":"2","key":"606_CR42","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/TCBB.2008.61","volume":"7","author":"X Liu","year":"2010","unstructured":"Liu, X., Li, J., Wang, L.: Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application. IEEE\/ACM Trans. Comput. Biol. Bioinformat. 7(2), 354\u2013364 (2010)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformat."},{"issue":"01","key":"606_CR43","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129626407002843","volume":"17","author":"A Lumsdaine","year":"2007","unstructured":"Lumsdaine, A., Gregor, D., Hendrickson, B., Berry, J.: Challenges in parallel graph processing. Parallel Process. Lett. 17(01), 5\u201320 (2007)","journal-title":"Parallel Process. Lett."},{"key":"606_CR44","doi-asserted-by":"crossref","unstructured":"Mohammad, A., Aleksandar, I., Boualem, B., Seyed-Mehdi-Reza, B., Elisa, B., Norman, F.: Collusion detection in online rating systems. In: Web Technologies and Applications, pp 196\u2013207 (2013)","DOI":"10.1007\/978-3-642-37401-2_21"},{"issue":"48","key":"606_CR45","doi-asserted-by":"publisher","first-page":"485005","DOI":"10.1088\/1751-8113\/42\/48\/485005","volume":"42","author":"J Nacher","year":"2009","unstructured":"Nacher, J., Ochiai, T., Hayashida, M., Akutsu, T.: A mathematical model for generating bipartite graphs and its application to protein networks. J. Phys. A Math. Theor. 42(48), 485005 (2009)","journal-title":"J. Phys. A Math. Theor."},{"key":"606_CR46","doi-asserted-by":"crossref","unstructured":"Ntoutsi, E., Stefanidis, K., N\u00f8rv\u00e5g, K., Kriegel, H.-P.: Fast group recommendations by applying user clustering. In: International Conference on Conceptual Modeling, Springer, pp 126\u2013140 (2012)","DOI":"10.1007\/978-3-642-34002-4_10"},{"key":"606_CR47","doi-asserted-by":"crossref","unstructured":"Ntoutsi, E., Stefanidis, K., Rausch, K., Kriegel, H.-P.: \u201cstrength lies in differences\u201d: diversifying friends for recommendations through subspace clustering. In: Proceedings of CIKM, pp 729\u2013738 (2014)","DOI":"10.1145\/2661829.2662026"},{"key":"606_CR48","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Maehara, T., Kawarabayashi, K.: Efficient pagerank tracking in evolving networks. In: Proceedings of SIGKDD, pp 875\u2013884 (2015)","DOI":"10.1145\/2783258.2783297"},{"issue":"4","key":"606_CR49","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/1282427.1282416","volume":"37","author":"RV Oliveira","year":"2007","unstructured":"Oliveira, R.V., Zhang, B., Zhang, L.: Observing the evolution of internet as topology. SIGCOMM Comput. Commun. Rev. 37(4), 313\u2013324 (2007)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"3","key":"606_CR50","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0166-218X(03)00333-0","volume":"131","author":"R Peeters","year":"2003","unstructured":"Peeters, R.: The maximum edge biclique problem is NP-complete. Dis. Appl. Math. 131(3), 651\u2013654 (2003)","journal-title":"Dis. Appl. Math."},{"key":"606_CR51","doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhang, Y., Zhang, W., Lin, X., Qin, L.: Efficient probabilistic k-core computation on uncertain graphs. In: Proceedings of ICDE, IEEE, pp 1192\u20131203 (2018)","DOI":"10.1109\/ICDE.2018.00110"},{"key":"606_CR52","doi-asserted-by":"crossref","unstructured":"Poernomo, A.K., Gopalkrishnan, V.: Towards efficient mining of proportional fault-tolerant frequent itemsets. In: Proceedings of SIGKDD, pp 697\u2013706 (2009)","DOI":"10.1145\/1557019.1557097"},{"issue":"7228","key":"606_CR53","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1038\/nature07532","volume":"457","author":"S Saavedra","year":"2009","unstructured":"Saavedra, S., Reed-Tsochas, F., Uzzi, B.: A simple model of bipartite cooperation for ecological and organizational networks. Nature 457(7228), 463\u2013466 (2009)","journal-title":"Nature"},{"key":"606_CR54","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.-V., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: Proceedings of KDD, ACM, pp 2150\u20132159 (2018)","DOI":"10.1145\/3219819.3220097"},{"issue":"6","key":"606_CR55","doi-asserted-by":"publisher","first-page":"433","DOI":"10.14778\/2536336.2536344","volume":"6","author":"AE Sar\u00edy\u00fcce","year":"2013","unstructured":"Sar\u00edy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. Proc. VLDB Endow. 6(6), 433\u2013444 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"606_CR56","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00778-016-0423-8","volume":"25","author":"AE Sar\u0131y\u00fcce","year":"2016","unstructured":"Sar\u0131y\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.-L., \u00c7ataly\u00fcrek, \u00dc.V.: Incremental k-core decomposition: algorithms and evaluation. VLDB J. 25(3), 425\u2013447 (2016)","journal-title":"VLDB J."},{"key":"606_CR57","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: Proceedings of WSDM, pp 504\u2013512 (2018)","DOI":"10.1145\/3159652.3159678"},{"issue":"3","key":"606_CR58","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"key":"606_CR59","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of PPoPP, pp 135\u2013146 (2013)","DOI":"10.1145\/2517327.2442530"},{"key":"606_CR60","doi-asserted-by":"crossref","unstructured":"Sim, K., Li, J., Gopalkrishnan, V., Liu, G.: Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investment. In: Proceedings of ICDM, pp 1059\u20131063 (2006)","DOI":"10.1109\/ICDM.2006.111"},{"key":"606_CR61","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Rajamanickam, S., Madduri, K.: BFS and coloring-based parallel algorithms for strongly connected components and related problems. In: Proceedings of IPDPS, pp 550\u2013559 (2014)","DOI":"10.1109\/IPDPS.2014.64"},{"key":"606_CR62","doi-asserted-by":"crossref","unstructured":"Wang, J., De\u00a0Vries, A.P., Reinders, M.J.: Unifying user-based and item-based collaborative filtering approaches by similarity fusion. In: Proceedings of SIGIR, pp 501\u2013508 (2006)","DOI":"10.1145\/1148170.1148257"},{"key":"606_CR63","doi-asserted-by":"crossref","unstructured":"Wang, J., Huang, P., Zhao, H., Zhang, Z., Zhao, B., Lee, D.L.: Billion-scale commodity embedding for e-commerce recommendation in alibaba. In: Proceedings of SIGKDD, pp 839\u2013848 (2018)","DOI":"10.1145\/3219819.3219869"},{"key":"606_CR64","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, W., Qin, L.: Efficient computing of radius-bounded k-cores. In: Proceedings of ICDE, pp 233\u2013244 (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"606_CR65","doi-asserted-by":"crossref","unstructured":"Wu, X., Yuan, L., Lin, X., Yang, S., Zhang, W.: Towards efficient k-tripeak decomposition on large graphs. In: Proceedings of DASFAA, pp 604\u2013621 (2019)","DOI":"10.1007\/978-3-030-18576-3_36"},{"issue":"2","key":"606_CR66","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1002\/pmic.200400962","volume":"5","author":"S Wuchty","year":"2005","unstructured":"Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics 5(2), 444\u2013449 (2005)","journal-title":"Proteomics"},{"key":"606_CR67","doi-asserted-by":"crossref","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. In: Proceedings of ICDE, pp 387\u2013398 (2015)","DOI":"10.1109\/ICDE.2015.7113300"},{"issue":"2","key":"606_CR68","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."},{"issue":"7","key":"606_CR69","first-page":"516","volume":"9","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ECC graph decomposition via graph reduction. PVLDB 9(7), 516\u2013527 (2016)","journal-title":"PVLDB"},{"issue":"3","key":"606_CR70","first-page":"338","volume":"11","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Effective and efficient dynamic graph coloring. PVLDB 11(3), 338\u2013351 (2017)","journal-title":"PVLDB"},{"issue":"2","key":"606_CR71","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00778-016-0451-4","volume":"26","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: I\/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2), 275\u2013300 (2017)","journal-title":"VLDB J."},{"issue":"5","key":"606_CR72","first-page":"922","volume":"30","author":"L Yuan","year":"2018","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE TKDE 30(5), 922\u2013935 (2018)","journal-title":"IEEE TKDE"},{"key":"606_CR73","doi-asserted-by":"crossref","unstructured":"Yuan, Q., Cong, G., Lin, C.-Y.: Com: a generative model for group recommendation. In: Proceedings of KDD, pp 163\u2013172 (2014)","DOI":"10.1145\/2623330.2623616"},{"key":"606_CR74","doi-asserted-by":"crossref","unstructured":"Zhang, F., Yuan, L., Zhang, Y., Qin, L., Lin, X., Zhou, A.: Discovering strong communities with user engagement and tie strength. In: Proceedings of DASFAA, pp 425\u2013441 (2018)","DOI":"10.1007\/978-3-319-91452-7_28"},{"key":"606_CR75","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: Proceedings of ICDE, pp 1049\u20131060 (2012)","DOI":"10.1109\/ICDE.2012.35"},{"issue":"1","key":"606_CR76","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1186\/1471-2105-15-110","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. BMC Bioinformat. 15(1), 110 (2014)","journal-title":"BMC Bioinformat."},{"key":"606_CR77","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X., Zhang, Y., Qin, L.: A fast order-based approach for core maintenance. In: Proceedings of ICDE, pp 337\u2013348 (2017)","DOI":"10.1109\/ICDE.2017.93"},{"key":"606_CR78","doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Proceedings of SIGMOD, pp 1323\u20131334 (2014)","DOI":"10.1145\/2588555.2612181"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00606-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-020-00606-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00606-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T20:02:56Z","timestamp":1614801776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-020-00606-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,4]]},"references-count":78,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["606"],"URL":"https:\/\/doi.org\/10.1007\/s00778-020-00606-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,4]]},"assertion":[{"value":"11 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}