{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T06:49:46Z","timestamp":1782370186139,"version":"3.54.5"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"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":[[2025,5]]},"DOI":"10.1007\/s00778-025-00915-x","type":"journal-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T11:46:06Z","timestamp":1745322366000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient indexing and searching of constrained core in hypergraphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1018-8727","authenticated-orcid":false,"given":"Qi","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"915_CR1","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-45995-2_51"},{"issue":"9","key":"915_CR2","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.14778\/3598581.3598582","volume":"16","author":"NA Arafat","year":"2023","unstructured":"Arafat, N.A., Khan, A., Rai, A.K., Ghosh, B.: Neighborhood-based hypergraph core decomposition. Proc. VLDB Endow. 16(9), 2061\u20132074 (2023)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR3","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR cs.DS0310049 (2003)"},{"issue":"2","key":"915_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., Zaver\u0161nik, M.: Fast algorithms for determining (generalized) core groups in social networks. Adv. Data Anal Classif. 5(2), 129\u2013145 (2011)","journal-title":"Adv. Data Anal Classif."},{"key":"915_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2020.05.004","volume":"874","author":"F Battiston","year":"2020","unstructured":"Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J., Petri, G.: Networks beyond pairwise interactions: structure and dynamics. Phys. Rep. 874, 1\u201392 (2020)","journal-title":"Phys. Rep."},{"issue":"6","key":"915_CR6","doi-asserted-by":"publisher","first-page":"2389","DOI":"10.1007\/s10618-023-00956-2","volume":"37","author":"F Bu","year":"2023","unstructured":"Bu, F., Lee, G., Shin, K.: Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications. Data Min. Knowl. Discov. 37(6), 2389\u20132437 (2023)","journal-title":"Data Min. Knowl. Discov."},{"key":"915_CR7","doi-asserted-by":"crossref","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)","DOI":"10.1109\/ICDE.2019.00017"},{"issue":"2","key":"915_CR8","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. Discret. Math. 32(2), 1458\u20131477 (2018)","journal-title":"SIAM J. Discret. Math."},{"key":"915_CR9","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."},{"issue":"28","key":"915_CR10","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1126\/sciadv.abh1303","volume":"7","author":"PS Chodrow","year":"2021","unstructured":"Chodrow, P.S., Veldt, N., Benson, A.R.: Generative hypergraph clustering: from blockmodels to modularity. Sci. Adv. 7(28), 1303 (2021)","journal-title":"Sci. Adv."},{"key":"915_CR11","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: 38th IEEE International Conference on Data Engineering, ICDE, pp. 1138\u20131151. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00090"},{"key":"915_CR12","unstructured":"Ciresan, D.C., Meier, U., Masci, J., Gambardella, L.M., Schmidhuber, J.: Flexible, high performance convolutional neural networks for image classification. In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp. 1237\u20131242. IJCAI\/AAAI (2011)"},{"key":"915_CR13","first-page":"3","volume":"16","author":"J Cohen","year":"2008","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Natl. Secur. Agency Tech. Rep. 16, 3\u201329 (2008)","journal-title":"Natl. Secur. Agency Tech. Rep."},{"key":"915_CR14","unstructured":"Corinzia, L., Penna, P., Szpankowski, W., Buhmann, J.M.: Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. In: International Conference on Artificial Intelligence and Statistics, AISTATS, Proceedings of Machine Learning Research, vol. 151, pp. 11,615\u201311,640. PMLR (2022)"},{"key":"915_CR15","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to algorithms, 2nd edn. McGraw-Hill Higher Education (2001)"},{"issue":"3","key":"915_CR16","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":"915_CR17","unstructured":"Delling, D., Dibbelt, J., Pajor, T., Z\u00fcndorf, T.: Faster transit routing by hyper partitioning. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS, OASICS, vol.\u00a059, pp. 8:1\u20138:14 (2017)"},{"key":"915_CR18","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":"14","key":"915_CR19","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.14778\/2556549.2556565","volume":"6","author":"P Fender","year":"2013","unstructured":"Fender, P., Moerkotte, G.: Counter strike: generic top-down join enumeration for hypergraphs. Proc. VLDB Endow. 6(14), 1822\u20131833 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR20","doi-asserted-by":"crossref","unstructured":"Gabert, K., Pinar, A., \u00c7ataly\u00fcrek, \u00dc.V.: A unifying framework to identify dense subgraphs on streams: Graph nuclei to hypergraph cores. In: The Fourteenth ACM International Conference on Web Search and Data Mining, pp. 689\u2013697. ACM (2021)","DOI":"10.1145\/3437963.3441790"},{"key":"915_CR21","doi-asserted-by":"crossref","unstructured":"Guha, S., McGregor, A., Tench, D.: Vertex and hyperedge connectivity in dynamic graph streams. In: T.\u00a0Milo, D.\u00a0Calvanese (eds.) Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS, pp. 241\u2013247. ACM (2015)","DOI":"10.1145\/2745754.2745763"},{"key":"915_CR22","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"},{"key":"915_CR23","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: International Conference on Management of Data, SIGMOD, pp. 1311\u20131322. ACM (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"11","key":"915_CR24","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.14778\/3137628.3137650","volume":"10","author":"I Kabiljo","year":"2017","unstructured":"Kabiljo, I., Karrer, B., Pundir, M., Pupyrev, S., Shalita, A., Akhremtsev, Y., Presta, A.: Social hash partitioner: a scalable distributed hypergraph partitioner. Proc. VLDB Endow. 10(11), 1418\u20131429 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR25","doi-asserted-by":"crossref","unstructured":"Kim, D., Kim, J., Lim, S., Jeong, H.J.: Exploring cohesive subgraphs in hypergraphs: The (k, g)-core approach. In: CIKM, pp. 4013\u20134017 (2023)","DOI":"10.1145\/3583780.3615275"},{"issue":"5","key":"915_CR26","doi-asserted-by":"publisher","first-page":"e1000385","DOI":"10.1371\/journal.pcbi.1000385","volume":"5","author":"S Klamt","year":"2009","unstructured":"Klamt, S., Haus, U.U., Theis, F.: Hypergraphs and cellular networks. PLoS Comput. Biol. 5(5), e1000385 (2009)","journal-title":"PLoS Comput. Biol."},{"key":"915_CR27","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: Imagenet classification with deep convolutional neural networks. In: Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems, pp. 1106\u20131114 (2012)"},{"key":"915_CR28","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: KONECT: the koblenz network collection. In: 22nd International World Wide Web Conference, WWW, pp. 1343\u20131350. International World Wide Web Conferences Steering Committee \/ ACM (2013)","DOI":"10.1145\/2487788.2488173"},{"issue":"2","key":"915_CR29","first-page":"103","volume":"4","author":"YY Lai","year":"2017","unstructured":"Lai, Y.Y., Wei, C.C., Wei, C.S.: The impact of increasing team size on project productivity. Res. J. Bus. Manage. 4(2), 103\u2013112 (2017)","journal-title":"Res. J. Bus. Manage."},{"key":"915_CR30","doi-asserted-by":"crossref","unstructured":"Lee, G., Choe, M., Shin, K.: Hashnwalk: Hash and random walk based anomaly detection in hyperedge streams. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI, pp. 2129\u20132137 (2022)","DOI":"10.24963\/ijcai.2022\/296"},{"issue":"11","key":"915_CR31","doi-asserted-by":"publisher","first-page":"2256","DOI":"10.14778\/3407790.3407823","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee, G., Ko, J., Shin, K.: Hypergraph motifs: concepts, algorithms, and discoveries. Proc. VLDB Endow. 13(11), 2256\u20132269 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.113645","volume":"173","author":"J Lee","year":"2023","unstructured":"Lee, J., Goh, K.I., Lee, D.S., Kahng, B.: (k, q)-core decomposition of hypergraphs. Chaos, Solitons, Fractals 173, 113645 (2023)","journal-title":"Chaos, Solitons, Fractals"},{"issue":"11","key":"915_CR33","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. Chinese Comput. Syst. 34(11), 2568\u20132573 (2013)","journal-title":"J. Chinese Comput. Syst."},{"key":"915_CR34","doi-asserted-by":"crossref","unstructured":"Lin, Y., Sun, J., Castro, P.C., Konuru, R.B., Sundaram, H., Kelliher, A.: Extracting community structure through relational hypergraphs. In: Proceedings of the 18th International Conference on World Wide Web, pp. 1213\u20131214. ACM (2009)","DOI":"10.1145\/1526709.1526934"},{"key":"915_CR35","doi-asserted-by":"crossref","unstructured":"Linghu, Q., Zhang, F., Lin, X., Zhang, W., Zhang, Y.: Global reinforcement of social networks: The anchored coreness problem. In: Proceedings of the 2020 International Conference on Management of Data, SIGMOD, pp. 2211\u20132226. ACM (2020)","DOI":"10.1145\/3318464.3389744"},{"issue":"2","key":"915_CR36","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00778-021-00673-6","volume":"31","author":"Q Linghu","year":"2022","unstructured":"Linghu, Q., Zhang, F., Lin, X., Zhang, W., Zhang, Y.: Anchored coreness: efficient reinforcement of social networks. VLDB J. 31(2), 227\u2013252 (2022)","journal-title":"VLDB J."},{"key":"915_CR37","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (a,$$\\beta $$)-core computation: an index-based approach. In: The World Wide Web Conference, WWW, pp. 1130\u20131141. ACM (2019)","DOI":"10.1145\/3308558.3313522"},{"issue":"5","key":"915_CR38","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.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs. VLDB J. 29(5), 1075\u20131099 (2020)","journal-title":"VLDB J."},{"key":"915_CR39","doi-asserted-by":"crossref","unstructured":"Liu, B., Zhang, F., Zhang, W., Lin, X., Zhang, Y.: Efficient community search with size constraint. In: 37th IEEE International Conference on Data Engineering, ICDE, pp. 97\u2013108. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00016"},{"issue":"9","key":"915_CR40","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.14778\/3461535.3461542","volume":"14","author":"Q Liu","year":"2021","unstructured":"Liu, Q., Zhu, X., Huang, X., Xu, J.: Local algorithms for distance-generalized core decomposition over large dynamic graphs. Proc. VLDB Endow. 14(9), 1531\u20131543 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR41","unstructured":"Liu, Y., Luo, Q., Xiao, M., Yu, D., Chen, H., Cheng, X.: Reordering and compression for hypergraph processing. IEEE Transactions on Computers pp. 1\u201314 (2024)"},{"key":"915_CR42","doi-asserted-by":"crossref","unstructured":"Luo, L., Fang, Y., Cao, X., Zhang, X., Zhang, W.: Detecting communities from heterogeneous graphs: a context path-based graph neural network model. In: CIKM\u201921: The 30th ACM International Conference on Information and Knowledge Management, pp. 1170\u20131180. ACM (2021)","DOI":"10.1145\/3459637.3482250"},{"issue":"2","key":"915_CR43","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s11280-024-01253-8","volume":"27","author":"Q Luo","year":"2024","unstructured":"Luo, Q., Xie, Z., Liu, Y., Yu, D., Cheng, X., Lin, X., Jia, X.: Sampling hypergraphs via joint unbiased random walk. World Wide Web (WWW) 27(2), 15 (2024)","journal-title":"World Wide Web (WWW)"},{"key":"915_CR44","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":"3","key":"915_CR45","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00778-022-00763-z","volume":"32","author":"Q Luo","year":"2023","unstructured":"Luo, Q., Yu, D., Cai, Z., Lin, X., Wang, G., Cheng, X.: Toward maintenance of hypercores in large-scale dynamic hypergraphs. VLDB J. 32(3), 647\u2013664 (2023)","journal-title":"VLDB J."},{"issue":"5","key":"915_CR46","doi-asserted-by":"publisher","first-page":"3709","DOI":"10.1007\/s11280-023-01196-6","volume":"26","author":"Q Luo","year":"2023","unstructured":"Luo, Q., Yu, D., Cai, Z., Zheng, Y., Cheng, X., Lin, X.: Core maintenance for hypergraph streams. World Wide Web (WWW) 26(5), 3709\u20133733 (2023)","journal-title":"World Wide Web (WWW)"},{"issue":"6","key":"915_CR47","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)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"915_CR48","doi-asserted-by":"crossref","unstructured":"Luo, Q., Yu, D., Cheng, X., Sheng, H., Lv, W.: Exploring truss maintenance in fully dynamic graphs: a mixed structure-based approach. IEEE Transactions on Computers pp. 1\u201312 (2022)","DOI":"10.1109\/TC.2022.3174594"},{"key":"915_CR49","doi-asserted-by":"crossref","unstructured":"Luo, Q., Yu, D., Liu, Y., Zheng, Y., Cheng, X., Lin, X.: Finer-grained engagement in hypergraphs. In: 39th IEEE International Conference on Data Engineering, ICDE 2023, Anaheim, CA, USA, April 3-7, 2023, pp. 423\u2013435. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00039"},{"issue":"1","key":"915_CR50","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)","journal-title":"VLDB J."},{"issue":"4","key":"915_CR51","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0153048","volume":"11","author":"A Mao","year":"2016","unstructured":"Mao, A., Mason, W., Suri, S., Watts, D.J.: An experimental study of team size and performance on a complex task. PloS one 11(4), e0153048 (2016)","journal-title":"PloS one"},{"issue":"3","key":"915_CR52","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"issue":"2","key":"915_CR53","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1093\/bib\/bbaa257","volume":"22","author":"G Muzio","year":"2020","unstructured":"Muzio, G., O\u2019Bray, L., Borgwardt, K.: Biological network analysis with deep learning. Brief. Bioinf. 22(2), 1515\u20131530 (2020)","journal-title":"Brief. Bioinf."},{"key":"915_CR54","unstructured":"Ouvrard, X.: Hypergraphs: an introduction and review. ArXiv abs\/2002.05014 (2020)"},{"key":"915_CR55","doi-asserted-by":"crossref","unstructured":"Papachristou, M., Kleinberg, J.M.: Core-periphery models for hypergraphs. In: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 1337\u20131347 (2022)","DOI":"10.1145\/3534678.3539272"},{"key":"915_CR56","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3442381.3450073"},{"issue":"1","key":"915_CR57","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TVCG.2021.3114759","volume":"28","author":"B Qu","year":"2022","unstructured":"Qu, B., Zhang, E., Zhang, Y.: Automatic polygon layout for primal-dual visualization of hypergraphs. IEEE Trans. Vis. Comput. Graph. 28(1), 633\u2013642 (2022)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"915_CR58","doi-asserted-by":"publisher","first-page":"97","DOI":"10.14778\/3021924.3021927","volume":"10","author":"AE Sariy\u00fcce","year":"2016","unstructured":"Sariy\u00fcce, A.E., Pinar, A.: Fast hierarchy construction for dense subgraphs. Proc. VLDB Endow. 10(3), 97\u2013108 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR59","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2736277.2741640"},{"issue":"4","key":"915_CR60","doi-asserted-by":"publisher","first-page":"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), 1\u201321 (2020)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"915_CR61","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"},{"issue":"9","key":"915_CR62","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)","journal-title":"Proc. VLDB Endow."},{"key":"915_CR63","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: 36th IEEE International Conference on Data Engineering, ICDE, pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"issue":"2","key":"915_CR64","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00778-021-00658-5","volume":"31","author":"K Wang","year":"2022","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 31(2), 203\u2013226 (2022)","journal-title":"VLDB J."},{"key":"915_CR65","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y.: Efficient and effective community search on large-scale bipartite graphs. In: International Conference on Data Engineering, ICDE, pp. 85\u201396 (2021)","DOI":"10.1109\/ICDE51399.2021.00015"},{"key":"915_CR66","doi-asserted-by":"crossref","unstructured":"Yang, Y., Fang, Y., Lin, X., Zhang, W.: Effective and efficient truss computation over large heterogeneous information networks. In: 36th IEEE International Conference on Data Engineering, ICDE, pp. 901\u2013912. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00083"},{"key":"915_CR67","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhang, W., Lin, X., Zhang, Y., Li, S.: Hgmatch: A match-by-hyperedge approach for subgraph matching on hypergraphs. In: International Conference on Data Engineering, ICDE, pp. 2063\u20132076 (2023)","DOI":"10.1109\/ICDE55515.2023.00160"},{"key":"915_CR68","doi-asserted-by":"crossref","unstructured":"Yu, F., El-Zaatari, H.M., Kosorok, M.R., Carnegie, A., Dave, G.: The application of exponential random graph models to collaboration networks in biomedical and health sciences a review. Netw. Model Anal. Health Inform. Bioinforma. 13(1), 5 (2024)","DOI":"10.1007\/s13721-023-00439-w"},{"key":"915_CR69","doi-asserted-by":"crossref","unstructured":"Zhang, C., Zhang, F., Zhang, W., Liu, B., Zhang, Y., Qin, L., Lin, X.: Exploring finer granularity within the cores: Efficient (k, p)-core computation. In: International Conference on Data Engineering, pp. 181\u2013192 (2020)","DOI":"10.1109\/ICDE48307.2020.00023"},{"issue":"3","key":"915_CR70","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s00778-023-00825-w","volume":"33","author":"J Zhang","year":"2024","unstructured":"Zhang, J., Yuan, L., Li, W., Qin, L., Zhang, Y., Zhang, W.: Label-constrained shortest path query processing on road networks. VLDB J. 33(3), 569\u2013593 (2024)","journal-title":"VLDB J."},{"key":"915_CR71","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Zhang, F., Lin, X., Zhang, W., Chen, C.: K-core maximization: An edge addition approach. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI, pp. 4867\u20134873 (2019)","DOI":"10.24963\/ijcai.2019\/676"},{"key":"915_CR72","doi-asserted-by":"crossref","unstructured":"Zhu, G., Lin, X., Zhu, K., Zhang, W., Yu, J.X.: Treespan: efficiently computing similarity all-matching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 529\u2013540. ACM (2012)","DOI":"10.1145\/2213836.2213896"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00915-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00915-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00915-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T11:28:34Z","timestamp":1747308514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00915-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":72,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["915"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00915-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"6 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no competing financial or non-financial interests related to this work. All authors have disclosed any relationships or interests that could be perceived to influence the submitted work. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest:"}}],"article-number":"34"}}