{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:27:18Z","timestamp":1786980438677,"version":"build-2736575974"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T00:00:00Z","timestamp":1663632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T00:00:00Z","timestamp":1663632000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00778-022-00763-z","type":"journal-article","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T12:03:13Z","timestamp":1663675393000},"page":"647-664","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Toward maintenance of hypercores in large-scale dynamic hypergraphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Qi","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9998-2398","authenticated-orcid":false,"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,20]]},"reference":[{"key":"763_CR1","first-page":"598","volume-title":"5th Latin American Symposium of Theoretical Informatics Proceedings. LATIN, Lecture Notes in Computer Science","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: 5th Latin American Symposium of Theoretical Informatics Proceedings. LATIN, Lecture Notes in Computer Science, vol. 2286, pp. 598\u2013612. Springer, Cancun, Mexico (2002)"},{"key":"763_CR2","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: Neural Information Processing Systems, pp. 41\u201350. (2005)"},{"issue":"2","key":"763_CR3","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3934\/nhm.2008.3.371","volume":"3","author":"JI Alvarez-Hamelin","year":"2008","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases. Netw. Heterog. Media 3(2), 371\u2013393 (2008). https:\/\/doi.org\/10.3934\/nhm.2008.3.371","journal-title":"Netw. Heterog. Media"},{"key":"763_CR4","doi-asserted-by":"crossref","unstructured":"Arya, D., Worring, M.: Exploiting relational information in social networks using geometric deep learning on hypergraphs. In: Proceedings of the International Conference on Multimedia Retrieval, ICMR, pp. 117\u2013125. ACM (2018)","DOI":"10.1145\/3206025.3206062"},{"key":"763_CR5","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"issue":"48","key":"763_CR6","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.M.: Simplicial closure and higher-order link prediction. Proc. Natl. Acad. Sci. USA 115(48), E11221\u2013E11230 (2018)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"763_CR7","doi-asserted-by":"crossref","unstructured":"Bu, J., Tan, S., Chen, C., Wang, C., Wu, H., Zhang, L., He, X.: Music recommendation by unified hypergraph: combining social media information and music content. In: Proceedings of the 18th International Conference on Multimedia, pp. 391\u2013400. ACM (2010)","DOI":"10.1145\/1873951.1874005"},{"key":"763_CR8","doi-asserted-by":"crossref","unstructured":"Chang, L., Qin, L.: Cohesive subgraph computation over large sparse graphs. In: 35th IEEE International Conference on Data Engineering, ICDE, pp. 2068\u20132071. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00241"},{"key":"763_CR9","doi-asserted-by":"publisher","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 205\u2013216. ACM (2013). https:\/\/doi.org\/10.1145\/2463676.2465323","DOI":"10.1145\/2463676.2465323"},{"issue":"7","key":"763_CR10","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24(7), 1216\u20131230 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"763_CR11","doi-asserted-by":"publisher","unstructured":"Chen, L., Liu, C., Liao, K., Li, J., Zhou, R.: Contextual community search over large social networks. In: 35th IEEE International Conference on Data Engineering, pp. 88\u201399. IEEE (2019). https:\/\/doi.org\/10.1109\/ICDE.2019.00017","DOI":"10.1109\/ICDE.2019.00017"},{"issue":"10","key":"763_CR12","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.14778\/3231751.3231755","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. Proc. VLDB Endow. 11(10), 1233\u20131246 (2018). https:\/\/doi.org\/10.14778\/3231751.3231755","journal-title":"Proc. VLDB Endow."},{"key":"763_CR13","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: Proceedings of the 27th International Conference on Data Engineering, ICDE, pp. 51\u201362. (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"2","key":"763_CR14","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1137\/16M1096402","volume":"32","author":"E Chlamt\u00e1\u010d","year":"2018","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Konrad, C., Kortsarz, G., Rabanca, G.: The densest k-subhypergraph problem. SIAM J. Discrete Math. 32(2), 1458\u20131477 (2018)","journal-title":"SIAM J. Discrete Math."},{"key":"763_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s41109-020-0252-y","volume":"5","author":"PS Chodrow","year":"2020","unstructured":"Chodrow, P.S., Mellor, A.: Annotated hypergraphs: models and applications. Appl. Netw. Sci. 5, 9 (2020)","journal-title":"Appl. Netw. Sci."},{"key":"763_CR16","first-page":"3","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Natl. Secur. Agency Techn. Rep. 16, 3\u201329 (2008)","journal-title":"Natl. Secur. Agency Techn. Rep."},{"issue":"4","key":"763_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1089\/brain.2012.0137","volume":"3","author":"M Daianu","year":"2013","unstructured":"Daianu, M., Jahanshad, N., Nir, T.M., Toga, A.W., Jack, C.R.J., Weiner, M.W., Thompson, P.M.: Breakdown of brain connectivity between normal aging and alzheimer\u2019s disease: a structural k-core network analysis. Brain Connect 3(4), 407\u2013422 (2013). https:\/\/doi.org\/10.1089\/brain.2012.0137","journal-title":"Brain Connect"},{"issue":"3","key":"763_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00778-019-00540-5","volume":"28","author":"A Das","year":"2019","unstructured":"Das, A., Svendsen, M., Tirthapura, S.: Incremental maintenance of maximal cliques in a dynamic graph. VLDB J. 28(3), 351\u2013375 (2019)","journal-title":"VLDB J."},{"key":"763_CR19","doi-asserted-by":"crossref","unstructured":"Do, M.T., Yoon, S., Hooi, B., Shin, K.: Structural patterns and generative models of real-world hypergraphs. In: KDD \u201920: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 176\u2013186. ACM (2020)","DOI":"10.1145\/3394486.3403060"},{"issue":"11","key":"763_CR20","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.S., Lin, X.: Efficient algorithms for densest subgraph discovery. Proc. VLDB Endow. 12(11), 1719\u20131732 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"763_CR21","unstructured":"Fatemi, B., Taslakian, P., V\u00e1zquez, D., Poole, D.: Knowledge hypergraphs: extending knowledge graphs beyond binary relations. CoRR abs\/1906.00137 (2019)"},{"key":"763_CR22","doi-asserted-by":"crossref","unstructured":"Feng, Y., You, H., Zhang, Z., Ji, R., Gao, Y.: Hypergraph neural networks. In: The Thirty-First Innovative Applications of Artificial Intelligence Conference, pp. 3558\u20133565. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"763_CR23","doi-asserted-by":"publisher","unstructured":"Gabert, K., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: Shared-memory scalable k-core maintenance on dynamic graphs and hypergraphs. In: IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 998\u20131007. IEEE (2021). https:\/\/doi.org\/10.1109\/IPDPSW52791.2021.00158","DOI":"10.1109\/IPDPSW52791.2021.00158"},{"key":"763_CR24","doi-asserted-by":"publisher","unstructured":"Gabert, K., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: A unifying framework to identify dense subgraphs on streams: graph nuclei to hypergraph cores. In: WSDM \u201921, The Fourteenth ACM International Conference on Web Search and Data Mining, pp. 689\u2013697. ACM (2021). https:\/\/doi.org\/10.1145\/3437963.3441790","DOI":"10.1145\/3437963.3441790"},{"key":"763_CR25","doi-asserted-by":"publisher","unstructured":"Gabert, K., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: A unifying framework to identify dense subgraphs on streams: graph nuclei to hypergraph cores. In: WSDM \u201921, The Fourteenth ACM International Conference on Web Search and Data Mining, pp. 689\u2013697. ACM (2021). https:\/\/doi.org\/10.1145\/3437963.3441790","DOI":"10.1145\/3437963.3441790"},{"key":"763_CR26","doi-asserted-by":"crossref","unstructured":"Gionis, A., Tsourakakis, C.E.: Dense subgraph discovery: KDD 2015 tutorial. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2313\u20132314. ACM (2015)","DOI":"10.1145\/2783258.2789987"},{"key":"763_CR27","doi-asserted-by":"crossref","unstructured":"Hu, S., Wu, X., Chan, T.H.: Maintaining densest subsets efficiently in evolving hypergraphs. In: Proceedings of Conference on Information and Knowledge Management, CIKM, pp. 929\u2013938. ACM (2017)","DOI":"10.1145\/3132847.3132907"},{"issue":"6","key":"763_CR28","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1109\/TPDS.2019.2960226","volume":"31","author":"Q Hua","year":"2020","unstructured":"Hua, Q., Shi, Y., Yu, D., Jin, H., Yu, J., Cai, Z., Cheng, X., Chen, H.: Faster parallel core maintenance algorithms in dynamic graphs. IEEE Trans. Parallel Distrib. Syst. 31(6), 1287\u20131300 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"763_CR29","doi-asserted-by":"crossref","unstructured":"Huang, J., Zhang, R., Yu, J.X.: Scalable hypergraph learning and processing. In: 2015 IEEE International Conference on Data Mining, ICDM, pp. 775\u2013780. IEEE Computer Society (2015)","DOI":"10.1109\/ICDM.2015.33"},{"key":"763_CR30","doi-asserted-by":"publisher","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: International Conference on Management of Data, SIGMOD, pp. 1311\u20131322. ACM (2014). https:\/\/doi.org\/10.1145\/2588555.2610495","DOI":"10.1145\/2588555.2610495"},{"key":"763_CR31","doi-asserted-by":"crossref","unstructured":"Hwang, T., Tian, Z., Kuang, R., Kocher, J.A.: Learning on weighted hypergraphs to integrate protein interactions and gene expressions for cancer outcome prediction. In: Proceedings of the 8th IEEE International Conference on Data Mining ICDM, pp. 293\u2013302. (2008)","DOI":"10.1109\/ICDM.2008.37"},{"issue":"1","key":"763_CR32","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2938412","volume":"3","author":"J Jiang","year":"2016","unstructured":"Jiang, J., Mitzenmacher, M., Thaler, J.: Parallel peeling algorithms. ACM Trans. Parallel Comput. 3(1), 7:1-7:27 (2016)","journal-title":"ACM Trans. Parallel Comput."},{"issue":"11","key":"763_CR33","doi-asserted-by":"publisher","first-page":"2416","DOI":"10.1109\/TPDS.2018.2835441","volume":"29","author":"H Jin","year":"2018","unstructured":"Jin, H., Wang, N., Yu, D., Hua, Q., Shi, X., Xie, X.: Core maintenance in dynamic graphs: a parallel approach based on matching. IEEE Trans. Parallel Distrib. Syst. 29(11), 2416\u20132428 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"763_CR34","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Large Scale Integr. Syst. 7(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"763_CR35","doi-asserted-by":"publisher","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.B.: What is twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, WWW, pp. 591\u2013600. ACM (2010). https:\/\/doi.org\/10.1145\/1772690.1772751","DOI":"10.1145\/1772690.1772751"},{"issue":"8","key":"763_CR36","doi-asserted-by":"publisher","first-page":"2279","DOI":"10.12733\/jics20101801","volume":"10","author":"M Leng","year":"2013","unstructured":"Leng, M., Sun, L.: Comparative experiment of the core property of weighted hyper-graph based on the ispd98 benchmark. J. Inf. Comput. 10(8), 2279\u20132290 (2013)","journal-title":"J. Inf. Comput."},{"issue":"11","key":"763_CR37","first-page":"2568","volume":"34","author":"M Leng","year":"2013","unstructured":"Leng, M., Sun, L., Bian, J., Ma, Y.: An $$o(m)$$ algorithm for cores decomposition of undirected hypergraph. J. Chin. Comput. Syst. 34(11), 2568\u20132573 (2013)","journal-title":"J. Chin. Comput. Syst."},{"key":"763_CR38","doi-asserted-by":"crossref","unstructured":"Li, D., Xu, Z., Li, S., Sun, X.: Link prediction in social networks based on hypergraph. In: 22nd International World Wide Web Conference, WWW Companion Volume, pp. 41\u201342. International World Wide Web Conferences Steering Committee\/ACM (2013)","DOI":"10.1145\/2487788.2487802"},{"key":"763_CR39","doi-asserted-by":"crossref","unstructured":"Li, J., He, J., Zhu, Y.: E-tail product return prediction via hypergraph-based local graph cut. In: Y.\u00a0Guo, F.\u00a0Farooq (eds.) Proceedings of the 24th ACM International Conference on Knowledge Discovery & Data Mining, KDD, pp. 519\u2013527. ACM (2018)","DOI":"10.1145\/3219819.3219829"},{"key":"763_CR40","doi-asserted-by":"publisher","unstructured":"Li, R., Qin, L., Ye, F., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD, pp. 457\u2013472. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3183736","DOI":"10.1145\/3183713.3183736"},{"key":"763_CR41","doi-asserted-by":"publisher","first-page":"3279","DOI":"10.1016\/j.physleta.2014.09.054","volume":"378","author":"JH Lin","year":"2014","unstructured":"Lin, J.H., Guo, Q., Dong, W., ying Tang, L., Liu, J.: Identifying the node spreading influence with largest k-core values. Phys. Lett. A 378, 3279\u20133284 (2014)","journal-title":"Phys. Lett. A"},{"issue":"10\u201311","key":"763_CR42","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1016\/j.patcog.2010.07.014","volume":"44","author":"Q Liu","year":"2011","unstructured":"Liu, Q., Huang, Y., Metaxas, D.N.: Hypergraph with sampling for image retrieval. Pattern Recogn. 44(10\u201311), 2255\u20132262 (2011)","journal-title":"Pattern Recogn."},{"key":"763_CR43","doi-asserted-by":"crossref","unstructured":"Luo, Q., Yu, D., Cai, Z., Lin, X., Cheng, X.: Hypercore maintenance in dynamic hypergraphs. In: International Conference on Data Engineering, pp. 2051\u20132056 (2021)","DOI":"10.1109\/ICDE51399.2021.00199"},{"issue":"6","key":"763_CR44","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1109\/TCSS.2020.3026574","volume":"7","author":"Q Luo","year":"2020","unstructured":"Luo, Q., Yu, D., Cheng, X., Cai, Z., Yu, J., Lv, W.: Batch processing for truss maintenance in large dynamic graphs. IEEE Trans. Comput. Soc. Syst. 7(6), 1435\u20131446 (2020). https:\/\/doi.org\/10.1109\/TCSS.2020.3026574","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"763_CR45","first-page":"16","volume-title":"8th International Conference Computational Data and Social Networks Proceedings. Lecture Notes in Computer Science","author":"Q Luo","year":"2019","unstructured":"Luo, Q., Yu, D., Li, F., Dou, Z., Cai, Z., Yu, J., Cheng, X.: Distributed core decomposition in probabilistic graphs. In: 8th International Conference Computational Data and Social Networks Proceedings. Lecture Notes in Computer Science, vol. 11917, pp. 16\u201332. Springer, Ho Chi Minh City, Vietnam (2019)"},{"issue":"1","key":"763_CR46","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","volume":"29","author":"FD Malliaros","year":"2020","unstructured":"Malliaros, F.D., Giatsidis, C., Papadopoulos, A.N., Vazirgiannis, M.: The core decomposition of networks: theory, algorithms and applications. VLDB J. 29(1), 61\u201392 (2020). https:\/\/doi.org\/10.1007\/s00778-019-00587-4","journal-title":"VLDB J."},{"issue":"6","key":"763_CR47","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TCAD.2002.1004312","volume":"21","author":"M Ouyang","year":"2002","unstructured":"Ouyang, M., Toulouse, M., Thulasiraman, K., Glover, F.W., Deogun, J.S.: Multilevel cooperative search for the circuit\/hypergraphpartitioning problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(6), 685\u2013693 (2002)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"763_CR48","doi-asserted-by":"publisher","unstructured":"Preti, G., Morales, G.D.F., Bonchi, F.: Strud: Truss decomposition of simplicial complexes. In: WWW \u201921: The Web Conference 2021, pp. 3408\u20133418. ACM\/IW3C2 (2021). https:\/\/doi.org\/10.1145\/3442381.3450073","DOI":"10.1145\/3442381.3450073"},{"issue":"3","key":"763_CR49","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00778-016-0423-8","volume":"25","author":"AE Sariy\u00fcce","year":"2016","unstructured":"Sariy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K., \u00c7ataly\u00fcrek, \u00dc.V.: Incremental k-core decomposition: algorithms and evaluation. VLDB J. 25(3), 425\u2013447 (2016)","journal-title":"VLDB J."},{"key":"763_CR50","doi-asserted-by":"publisher","unstructured":"Sariy\u00fcce, A.E., Seshadhri, C., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: Finding the hierarchy of dense subgraphs using nucleus decompositions. In: Proceedings of the 24th International Conference on World Wide Web, pp. 927\u2013937. ACM (2015). https:\/\/doi.org\/10.1145\/2736277.2741640","DOI":"10.1145\/2736277.2741640"},{"issue":"3","key":"763_CR51","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":"763_CR52","doi-asserted-by":"publisher","unstructured":"Shin, K., Eliassi-Rad, T., Faloutsos, C.: Corescope: Graph mining using k-core analysis - patterns, anomalies and algorithms. In: IEEE 16th International Conference on Data Mining, ICDM, pp. 469\u2013478. IEEE Computer Society. https:\/\/doi.org\/10.1109\/ICDM.2016.0058","DOI":"10.1109\/ICDM.2016.0058"},{"key":"763_CR53","doi-asserted-by":"crossref","unstructured":"Shun, J.: Practical parallel hypergraph algorithms. In: PPoPP \u201920: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 232\u2013249. ACM (2020)","DOI":"10.1145\/3332466.3374527"},{"issue":"4","key":"763_CR54","doi-asserted-by":"publisher","first-page":"39:1","DOI":"10.1145\/3385416","volume":"14","author":"B Sun","year":"2020","unstructured":"Sun, B., Chan, T.H., Sozio, M.: Fully dynamic approximate k-core decomposition in hypergraphs. ACM Trans. Knowl. Discov. Data 14(4), 39:1-39:21 (2020)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"763_CR55","doi-asserted-by":"crossref","unstructured":"Tan, H., Ngo, C., Wu, X.: Modeling video hyperlinks with hypergraph for web video reranking. In: Proceedings of the 16th International Conference on Multimedia, pp. 659\u2013662. ACM (2008)","DOI":"10.1145\/1459359.1459453"},{"key":"763_CR56","doi-asserted-by":"crossref","unstructured":"Tan, S., Guan, Z., Cai, D., Qin, X., Bu, J., Chen, C.: Mapping users across networks by manifold alignment on hypergraph. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 159\u2013165. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8720"},{"key":"763_CR57","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: The k-clique densest subgraph problem. In: Proceedings of the 24th International Conference on World Wide Web, WWW, pp. 1122\u20131132. ACM (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"763_CR58","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.A.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 104\u2013112. ACM (2013)","DOI":"10.1145\/2487575.2487645"},{"issue":"9","key":"763_CR59","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/2311906.2311909","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proc. VLDB Endow. 5(9), 812\u2013823 (2012). https:\/\/doi.org\/10.14778\/2311906.2311909","journal-title":"Proc. VLDB Endow."},{"key":"763_CR60","doi-asserted-by":"crossref","unstructured":"Wang, N., Yu, D., Jin, H., Qian, C., Xie, X., Hua, Q.: Parallel algorithm for core maintenance in dynamic graphs. In: K.\u00a0Lee, L.\u00a0Liu (eds.) 37th IEEE International Conference on Distributed Computing Systems, ICDCS, pp. 2366\u20132371. IEEE Computer Society (2017)","DOI":"10.1109\/ICDCS.2017.288"},{"key":"763_CR61","doi-asserted-by":"crossref","unstructured":"Wen, D., Qin, L., Zhang, Y., Lin, X., Yu, J.X.: I\/O efficient core graph decomposition at web scale. In: 32nd IEEE International Conference on Data Engineering, ICDE, pp. 133\u2013144. (2016)","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"763_CR62","doi-asserted-by":"crossref","unstructured":"Yang, D., Qu, B., Yang, J., Cudr\u00e9-Mauroux, P.: Revisiting user mobility and social relationships in lbsns: A hypergraph embedding approach. In: The World Wide Web Conference, WWW, pp. 2147\u20132157. ACM (2019)","DOI":"10.1145\/3308558.3313635"},{"issue":"3","key":"763_CR63","doi-asserted-by":"publisher","first-page":"171","DOI":"10.26599\/BDMA.2020.9020002","volume":"3","author":"D Yu","year":"2020","unstructured":"Yu, D., Zhang, L., Luo, Q., Cheng, X., Yu, J., Cai, Z.: Fast skyline community search in multi-valued networks. Big Data Min. Anal. 3(3), 171\u2013180 (2020). https:\/\/doi.org\/10.26599\/BDMA.2020.9020002","journal-title":"Big Data Min. Anal."},{"issue":"2","key":"763_CR64","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). https:\/\/doi.org\/10.1007\/s00778-016-0451-4","journal-title":"VLDB J."},{"key":"763_CR65","doi-asserted-by":"crossref","unstructured":"Zhang, M., Cui, Z., Jiang, S., Chen, Y.: Beyond link prediction: Predicting hyperlinks in adjacency space. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, pp. 4430\u20134437. AAAI Press (2018)","DOI":"10.1609\/aaai.v32i1.11780"},{"issue":"4","key":"763_CR66","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1007\/s11280-017-0494-5","volume":"21","author":"X Zheng","year":"2018","unstructured":"Zheng, X., Luo, Y., Sun, L., Ding, X., Zhang, J.: A novel social network hybrid recommender system based on hypergraph topologic structure. World Wide Web 21(4), 985\u20131013 (2018)","journal-title":"World Wide Web"},{"key":"763_CR67","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: Clustering, classification, and embedding. In: Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, pp. 1601\u20131608. MIT Press (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"763_CR68","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.neucom.2016.07.030","volume":"216","author":"Y Zhu","year":"2016","unstructured":"Zhu, Y., Guan, Z., Tan, S., Liu, H., Cai, D., He, X.: Heterogeneous hypergraph embedding for document recommendation. Neurocomputing 216, 150\u2013162 (2016)","journal-title":"Neurocomputing"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00763-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00763-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00763-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T02:33:20Z","timestamp":1701052400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00763-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,20]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["763"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00763-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,20]]},"assertion":[{"value":"22 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}