{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T08:05:34Z","timestamp":1768723534503,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802451"],"award-info":[{"award-number":["61802451"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1911201"],"award-info":[{"award-number":["U1911201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10618-021-00805-0","type":"journal-article","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T08:05:47Z","timestamp":1635235547000},"page":"209-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Generalized core maintenance of dynamic bipartite graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Wen","family":"Bai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yadi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Di","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhichuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yipeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,26]]},"reference":[{"key":"805_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed A, Batagelj V, Fu X, Hong SH, Merrick D, Mrvar A (2007) Visualisation and analysis of the internet movie database. In: International Asia-Pacific symposium on visualization, pp 17\u201324","DOI":"10.1109\/APVIS.2007.329304"},{"issue":"1","key":"805_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu EA (1973) The enumeration of maximal cliques of large graphs. SIAM J Comput 2(1):1\u20136","journal-title":"SIAM J Comput"},{"key":"805_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.ins.2019.11.003","volume":"513","author":"W Bai","year":"2020","unstructured":"Bai W, Chen Y, Wu D (2020) Efficient temporal core maintenance of massive graphs. Inf Sci 513:324\u2013340","journal-title":"Inf Sci"},{"key":"805_CR4","doi-asserted-by":"crossref","unstructured":"Berlowitz D, Cohen S, Kimelfeld B (2015) Efficient enumeration of maximal k-plexes. In: ACM SIGMOD international conference on management of data, pp 431\u2013444","DOI":"10.1145\/2723372.2746478"},{"key":"805_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi F, Gullo F, Kaltenbrunner A, Volkovich Y (2014) Core decomposition of uncertain graphs. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 1316\u20131325","DOI":"10.1145\/2623330.2623655"},{"key":"805_CR6","doi-asserted-by":"crossref","unstructured":"Cheng J, Ke Y, Chu S, Ozsu MT (2011) Efficient core decomposition in massive networks. In: IEEE international conference on data engineering, pp 51\u201362","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"805_CR7","doi-asserted-by":"crossref","unstructured":"Cheng Y, Lu C, Wang N (2013) Local k-core clustering for gene networks. In: IEEE international conference on bioinformatics and biomedicine, pp 9\u201315","DOI":"10.1109\/BIBM.2013.6732603"},{"key":"805_CR8","doi-asserted-by":"crossref","unstructured":"Ding D, Li H, Huang Z, Mamoulis N (2017) Efficient fault-tolerant group recommendation using alpha-beta-core. In: ACM international conference on information and knowledge management, pp 2047\u20132050","DOI":"10.1145\/3132847.3133130"},{"key":"805_CR9","doi-asserted-by":"crossref","unstructured":"Giatsidis C, Thilikos DM, Vazirgiannis M (2012) D-cores: measuring collaboration of directed graphs based on degeneracy. In: IEEE international conference on data mining, pp 311\u2013343","DOI":"10.1007\/s10115-012-0539-0"},{"issue":"1","key":"805_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2016.2611584","volume":"29","author":"X He","year":"2017","unstructured":"He X, Gao M, Kan MY, Wang D (2017) Birank: towards ranking on bipartite graphs. IEEE Trans Knowl Data Eng 29(1):57\u201371","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"805_CR11","doi-asserted-by":"crossref","unstructured":"Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: ACM SIGMOD international conference on management of data, pp 1311\u20131322","DOI":"10.1145\/2588555.2610495"},{"key":"805_CR12","doi-asserted-by":"crossref","unstructured":"Jiang H, Li CM, Manya F (2017) An exact algorithm for the maximum weight clique problem in large graphs. In: Proceedings of the AAAI conference on artificial intelligence, pp 830\u2013838","DOI":"10.1609\/aaai.v31i1.10648"},{"issue":"1","key":"805_CR13","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 (2015) k-core decomposition of large networks on a single pc. Proc VLDB Endow 9(1):13\u201323","journal-title":"Proc VLDB Endow"},{"issue":"10","key":"805_CR14","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"RH Li","year":"2014","unstructured":"Li RH, Yu JX, Mao R (2014) Efficient core maintenance in large dynamic graphs. IEEE Trans Knowl Data Eng 26(10):2453\u20132465","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"805_CR15","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00778-020-00606-9","volume":"29","author":"B Liu","year":"2020","unstructured":"Liu B, Yuan L, Lin X, Qin L, Zhang W, Zhou J (2020) Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs. VLDB J 29(5):1075\u20131099","journal-title":"VLDB J"},{"issue":"11","key":"805_CR16","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.14778\/3137628.3137660","volume":"10","author":"C Lu","year":"2017","unstructured":"Lu C, Yu JX, Wei H, Zhang Y (2017) Finding the maximum clique in massive graphs. Proc VLDB Endow 10(11):1538\u20131549","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"805_CR17","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TPDS.2012.124","volume":"24","author":"A Montresor","year":"2011","unstructured":"Montresor A, De Pellegrini F, Miorandi D (2011) Distributed k-core decomposition. IEEE Trans Parallel Distrib Syst 24(2):288\u2013300","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"5","key":"805_CR18","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TSC.2016.2523997","volume":"10","author":"AP Mukherjee","year":"2017","unstructured":"Mukherjee AP, Tirthapura S (2017) Enumerating maximal bicliques from a large graph using mapreduce. IEEE Trans Serv Comput 10(5):771\u2013784","journal-title":"IEEE Trans Serv Comput"},{"issue":"6","key":"805_CR19","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 AE, Gedik B, Jacques-Silva G, Wu KL, \u00c7ataly\u00fcrek \u00dcV (2013) Streaming algorithms for k-core decomposition. Proc VLDB Endow 6(6):433\u2013444","journal-title":"Proc VLDB Endow"},{"issue":"5","key":"805_CR20","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1007\/s10618-018-0602-x","volume":"33","author":"K Semertzidis","year":"2019","unstructured":"Semertzidis K, Pitoura E, Terzi E, Tsaparas P (2019) Finding lasting dense subgraphs. Data Min Knowl Discov 33(5):1417\u20131445","journal-title":"Data Min Knowl Discov"},{"key":"805_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.ins.2018.03.036","volume":"448","author":"X Wang","year":"2018","unstructured":"Wang X, Liu J (2018) A comparative study of the measures for evaluating community structure in bipartite networks. Inf Sci 448:249\u2013262","journal-title":"Inf Sci"},{"key":"805_CR22","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.ins.2017.12.012","volume":"432","author":"Y Wang","year":"2018","unstructured":"Wang Y, Cai S, Yin M (2018) New heuristic approaches for maximum balanced biclique problem. Inf Sci 432:362\u2013375","journal-title":"Inf Sci"},{"key":"805_CR23","doi-asserted-by":"crossref","unstructured":"Wen D, Qin L, Zhang Y, Lin X, Yu JX (2016) I\/o efficient core graph decomposition at web scale. In: IEEE international conference on data engineering, pp 133\u2013144","DOI":"10.1109\/ICDE.2016.7498235"},{"issue":"1","key":"805_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TKDE.2018.2833070","volume":"31","author":"D Wen","year":"2019","unstructured":"Wen D, Qin L, Zhang Y, Lin X, Yu JX (2019) I\/o efficient core graph decomposition: application to degeneracy ordering. IEEE Trans Knowl Data Eng 31(1):75\u201390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"805_CR25","doi-asserted-by":"publisher","first-page":"721","DOI":"10.14778\/2732939.2732945","volume":"7","author":"H Wu","year":"2014","unstructured":"Wu H, Cheng J, Huang S, Ke Y, Lu Y, Xu Y (2014) Path problems in temporal graphs. Proc VLDB Endow 7(9):721\u2013732","journal-title":"Proc VLDB Endow"},{"key":"805_CR26","doi-asserted-by":"crossref","unstructured":"Wu H, Cheng J, Lu Y, and Ke Y (2015) Core decomposition in large temporal graphs. In: IEEE international conference on big data, pp 649\u2013658","DOI":"10.1109\/BigData.2015.7363809"},{"key":"805_CR27","doi-asserted-by":"crossref","unstructured":"Yang Y, Yan D, Wu H, Cheng J, Zhou S, Lui J (2016) Diversified temporal subgraph pattern mining. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 1965\u20131974","DOI":"10.1145\/2939672.2939848"},{"key":"805_CR28","doi-asserted-by":"crossref","unstructured":"Zhang Y, Yu JX, Zhang Y, Qin L (2017) A fast order-based approach for core maintenance. In: International conference on data engineering, pp 337\u2013348","DOI":"10.1109\/ICDE.2017.93"},{"key":"805_CR29","doi-asserted-by":"crossref","unstructured":"Zou Z (2016) Bitruss decomposition of bipartite graphs. In: International conference on database systems for advanced applications, pp 218\u2013233","DOI":"10.1007\/978-3-319-32049-6_14"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00805-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00805-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00805-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T21:10:15Z","timestamp":1673644215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00805-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["805"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00805-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"14 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}