{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:18:22Z","timestamp":1765531102305,"version":"3.48.0"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"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,11]]},"DOI":"10.1007\/s00778-025-00942-8","type":"journal-article","created":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T15:40:21Z","timestamp":1757346021000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Density decomposition on large static and dynamic graphs: algorithms and applications"],"prefix":"10.1007","volume":"34","author":[{"given":"Qi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yalong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchao","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,8]]},"reference":[{"issue":"11","key":"942_CR1","first-page":"5482","volume":"36","author":"W Ai","year":"2024","unstructured":"Ai, W., Xie, C., Meng, T., Du, J., Li, K.: A d-truss-equivalence based index for community search over large directed graphs. IEEE TKDE 36(11), 5482\u20135494 (2024)","journal-title":"IEEE TKDE"},{"key":"942_CR2","doi-asserted-by":"crossref","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. In: PVLDB, vol.\u00a010, pp. 1298\u20131309 (2017)","DOI":"10.14778\/3137628.3137640"},{"issue":"11","key":"942_CR3","first-page":"1298","volume":"10","author":"E Akbas","year":"2017","unstructured":"Akbas, E., Zhao, P.: Truss-based community search: a truss-equivalence based indexing approach. PVLDB 10(11), 1298\u20131309 (2017)","journal-title":"PVLDB"},{"key":"942_CR4","unstructured":"Alvarez-Hamelin, J.I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: Large scale networks fingerprinting and visualization using the k-core decomposition. In: NIPS, pp. 41\u201350 (2005)"},{"issue":"5","key":"942_CR5","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. Data Min. Knowl. Discov. 29(5), 1406\u20131433 (2015)","journal-title":"Data Min. Knowl. Discov."},{"key":"942_CR6","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. Data Min. Knowl. Disc. 29, 1406\u20131433 (2015)","journal-title":"Data Min. Knowl. Disc."},{"key":"942_CR7","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. CoRR cs.DS\/0310049 (2003)"},{"key":"942_CR8","doi-asserted-by":"crossref","unstructured":"Beutel, A., Xu, W., Guruswami, V., Palow, C., Faloutsos, C.: Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In: WWW, pp. 119\u2013130 (2013)","DOI":"10.1145\/2488388.2488400"},{"key":"942_CR9","unstructured":"Bez\u00e1kov\u00e1, I.: Compact representations of graphs and adjacency testing. Master\u2019s thesis, Comenius University (2000)"},{"key":"942_CR10","doi-asserted-by":"crossref","unstructured":"Blumenstock, M.: Fast algorithms for pseudoarboricity. In: ALENEX, pp. 113\u2013126 (2016)","DOI":"10.1137\/1.9781611974317.10"},{"key":"942_CR11","doi-asserted-by":"crossref","unstructured":"Blumenstock, M.: Fast algorithms for pseudoarboricity. In: ALENEX, pp. 113\u2013126. SIAM (2016)","DOI":"10.1137\/1.9781611974317.10"},{"key":"942_CR12","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Khan, A., Severini, L.: Distance-generalized core decomposition. In: SIGMOD, pp. 1006\u20131023 (2019)","DOI":"10.1145\/3299869.3324962"},{"key":"942_CR13","doi-asserted-by":"crossref","unstructured":"Boob, D., Gao, Y., Peng, R., Sawlani, S., Tsourakakis, C.E., Wang, D., Wang, J.: Flowless: Extracting densest subgraphs without flow computations. In: WWW, pp. 573\u2013583 (2020)","DOI":"10.1145\/3366423.3380140"},{"issue":"4","key":"942_CR14","first-page":"687","volume":"21","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Iglesias, J., Migler, T., Ochoa, A., Wilfong, G., Zhang, L.: Egalitarian graph orientations. JGAA 21(4), 687\u2013708 (2017)","journal-title":"Egalitarian graph orientations. JGAA"},{"issue":"4","key":"942_CR15","doi-asserted-by":"publisher","first-page":"687","DOI":"10.7155\/jgaa.00435","volume":"21","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Iglesias, J., Migler, T., Ochoa, A., Wilfong, G.T., Zhang, L.: Egalitarian graph orientations. J. Graph Algorithms Appl. 21(4), 687\u2013708 (2017)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"942_CR16","first-page":"625","volume":"23","author":"G Borradaile","year":"2019","unstructured":"Borradaile, G., Migler, T., Wilfong, G.T.: Density decompositions of networks. JGAA 23(4), 625\u2013651 (2019)","journal-title":"Density decompositions of networks. JGAA"},{"key":"942_CR17","doi-asserted-by":"crossref","unstructured":"Chang, L., Lin, X., Qin, L., Yu, J.X., Zhang, W.: Index-based optimal algorithms for computing steiner components with maximum connectivity. In: SIGMOD, pp. 459\u2013474 (2015)","DOI":"10.1145\/2723372.2746486"},{"key":"942_CR18","doi-asserted-by":"crossref","unstructured":"Chang, L., Wang, Z.: A near-optimal approach to edge connectivity-based hierarchical graph decomposition. In: PVLDB, vol.\u00a015, pp. 1146\u20131158 (2022)","DOI":"10.14778\/3514061.3514063"},{"key":"942_CR19","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: SIGMOD, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"942_CR20","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: APPROX, Lecture Notes in Computer Science, vol. 1913, pp. 84\u201395 (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"key":"942_CR21","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K., Torres, M.R.: Densest subgraph: Supermodularity, iterative peeling, and flow. In: SODA, pp. 1531\u20131555. SIAM (2022)","DOI":"10.1137\/1.9781611977073.64"},{"key":"942_CR22","unstructured":"Chen, Y., Zhang, J., Fang, Y., Cao, X., King, I.: An augmented index-based efficient community search for large directed graphs. CoRR arxiv:abs\/2311.06487 (2023)"},{"issue":"1","key":"942_CR23","first-page":"210","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SICOMP 14(1), 210\u2013223 (1985)","journal-title":"Arboricity and subgraph listing algorithms. SICOMP"},{"issue":"5","key":"942_CR24","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SICOMP 32(5), 1338\u20131355 (2003)","journal-title":"SICOMP"},{"key":"942_CR25","unstructured":"Cohen, J.: Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16(3.1), 1\u201329 (2008)"},{"key":"942_CR26","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Second Edition (2001)"},{"issue":"1","key":"942_CR27","first-page":"77:1","volume":"1","author":"Q Dai","year":"2023","unstructured":"Dai, Q., Li, R., Liao, M., Wang, G.: Maximal defective clique enumeration. SIGMOD 1(1), 77:1-77:26 (2023)","journal-title":"Maximal defective clique enumeration. SIGMOD"},{"key":"942_CR28","doi-asserted-by":"crossref","unstructured":"Dai, Q., Li, R., Qin, H., Liao, M., Wang, G.: Scaling up maximal k-plex enumeration. In: CIKM, pp. 345\u2013354 (2022)","DOI":"10.1145\/3511808.3557444"},{"key":"942_CR29","doi-asserted-by":"crossref","unstructured":"Dai, Q., Li, R., Qin, L., Wang, G., Yang, W., Zhang, Z., Yuan, Y.: Scaling up distance-generalized core decomposition. In: CIKM, pp. 312\u2013321 (2021)","DOI":"10.1145\/3459637.3482294"},{"key":"942_CR30","doi-asserted-by":"crossref","unstructured":"Danisch, M., Chan, T.H., Sozio, M.: Large scale density-friendly graph decomposition via convex programming. In: WWW, pp. 233\u2013242 (2017)","DOI":"10.1145\/3038912.3052619"},{"key":"942_CR31","doi-asserted-by":"crossref","unstructured":"Duncan, L.R., D., P.A.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949)","DOI":"10.1007\/BF02289146"},{"issue":"4","key":"942_CR32","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"942_CR33","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, C., Luo, S., Hu, J.: Effective community search for large attributed graphs. PVLDB (2016)","DOI":"10.14778\/2994509.2994538"},{"key":"942_CR34","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, R.: On attributed community search. In: MATES, Lecture Notes in Computer Science, vol. 10731, pp. 1\u201321 (2017)","DOI":"10.1007\/978-3-319-73521-4_1"},{"key":"942_CR35","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, 803\u2013828 (2017)","journal-title":"VLDB J."},{"issue":"11","key":"942_CR36","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"},{"key":"942_CR37","doi-asserted-by":"crossref","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. In: ISMB, pp. 156\u2013157 (2006)","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"942_CR38","doi-asserted-by":"crossref","unstructured":"Gao, S., Li, R., Qin, H., Chen, H., Yuan, Y., Wang, G.: Colorful h-star core decomposition. In: ICDE, pp. 2588\u20132601 (2022)","DOI":"10.1109\/ICDE53745.2022.00239"},{"key":"942_CR39","doi-asserted-by":"crossref","unstructured":"Giatsidis, C., Thilikos, D.M., Vazirgiannis, M.: D-cores: Measuring collaboration of directed graphs based on degeneracy. In: ICDM, pp. 201\u2013210 (2011)","DOI":"10.1109\/ICDM.2011.46"},{"key":"942_CR40","volume-title":"Finding a maximum density subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. University of California Berkeley, Berkeley, CA, USA, Tech. rep. (1984)"},{"key":"942_CR41","first-page":"26966","volume":"35","author":"E Harb","year":"2022","unstructured":"Harb, E., Quanrud, K., Chekuri, C.: Faster and scalable algorithms for densest subgraph and decomposition. NIPS 35, 26966\u201326979 (2022)","journal-title":"NIPS"},{"key":"942_CR42","doi-asserted-by":"crossref","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Scaling up k-clique densest subgraph detection. SIGMOD 1(1), 69:1\u201369:26 (2023)","DOI":"10.1145\/3588923"},{"key":"942_CR43","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: SIGMOD, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"9","key":"942_CR44","first-page":"949","volume":"10","author":"X Huang","year":"2017","unstructured":"Huang, X., Lakshmanan, L.V.S.: Attribute-driven community search. PVLDB 10(9), 949\u2013960 (2017)","journal-title":"Attribute-driven community search. PVLDB"},{"issue":"4","key":"942_CR45","first-page":"276","volume":"9","author":"X Huang","year":"2015","unstructured":"Huang, X., Lakshmanan, L.V.S., Yu, J.X., Cheng, H.: Approximate closest community search in networks. PVLDB 9(4), 276\u2013287 (2015)","journal-title":"PVLDB"},{"key":"942_CR46","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD, pp. 813\u2013826 (2009)","DOI":"10.1145\/1559845.1559930"},{"issue":"11\u201316","key":"942_CR47","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/S1389-1286(99)00040-7","volume":"31","author":"R Kumar","year":"1999","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. Comput. Networks 31(11\u201316), 1481\u20131493 (1999)","journal-title":"Comput. Networks"},{"key":"942_CR48","doi-asserted-by":"crossref","unstructured":"Li, R., Qin, L., Ye, F., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: SIGMOD, pp. 457\u2013472 (2018)","DOI":"10.1145\/3183713.3183736"},{"issue":"5","key":"942_CR49","first-page":"509","volume":"8","author":"R Li","year":"2015","unstructured":"Li, R., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. PVLDB 8(5), 509\u2013520 (2015)","journal-title":"PVLDB"},{"issue":"7","key":"942_CR50","first-page":"3335","volume":"34","author":"R Li","year":"2022","unstructured":"Li, R., Song, Q., Xiao, X., Qin, L., Wang, G., Yu, J.X., Mao, R.: I\/o-efficient algorithms for degeneracy computation on massive networks. TKDE 34(7), 3335\u20133348 (2022)","journal-title":"TKDE"},{"issue":"10","key":"942_CR51","first-page":"2453","volume":"26","author":"R Li","year":"2014","unstructured":"Li, R., Yu, J.X., Mao, R.: Efficient core maintenance in large dynamic graphs. TKDE 26(10), 2453\u20132465 (2014)","journal-title":"TKDE"},{"key":"942_CR52","doi-asserted-by":"crossref","unstructured":"Li, R.H., Su, J., Qin, L., Yu, J.X., Dai, Q.: Persistent community search in temporal networks. In: ICDE, pp. 797\u2013808 (2018)","DOI":"10.1109\/ICDE.2018.00077"},{"key":"942_CR53","first-page":"2719","volume":"15","author":"Finding locally densest subgraphs","year":"2022","unstructured":"Finding locally densest subgraphs: Ma, C., Cheng, R., Lakshmanan, L.V.S., Han, X. A convex programming approach. In: PVLDB 15, 2719\u20132732 (2022)","journal-title":"A convex programming approach. In: PVLDB"},{"key":"942_CR54","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V.S., Han, X.: A convex-programming approach for efficient directed densest subgraph discovery. In: SIGMOD, pp. 845\u2013859 (2022)","DOI":"10.1145\/3514221.3517837"},{"key":"942_CR55","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V.S., Zhang, W., Lin, X.: On directed densest subgraph discovery. TODS 46(4), 13:1\u201313:45 (2021)","DOI":"10.1145\/3483940"},{"issue":"3","key":"942_CR56","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. JACM 30(3), 417\u2013427 (1983)","journal-title":"JACM"},{"issue":"2","key":"942_CR57","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"J Picard","year":"1982","unstructured":"Picard, J., Queyranne, M.: A network flow solution to some nonlinear 0\u20131 programming problems, with applications to graph theory. Networks 12(2), 141\u2013159 (1982)","journal-title":"Networks"},{"key":"942_CR58","doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R., Chang, L., Zhang, C.: Locally densest subgraph discovery. In: KDD, pp. 965\u2013974 (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"942_CR59","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, pp. 4292\u20134293 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"942_CR60","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Gedik, B., Jacques-Silva, G., Wu, K., \u00c7ataly\u00fcrek, \u00dc.V.: Streaming algorithms for k-core decomposition. In: PVLDB, vol.\u00a06, pp. 433\u2013444 (2013)","DOI":"10.14778\/2536336.2536344"},{"key":"942_CR61","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Pinar, A.: Fast hierarchy construction for dense subgraphs. In: PVLDB, vol.\u00a010, pp. 97\u2013108 (2016)","DOI":"10.14778\/3021924.3021927"},{"key":"942_CR62","doi-asserted-by":"crossref","unstructured":"Sariy\u00fcce, A.E., Seshadhri, C., Pinar, A.: Local algorithms for hierarchical dense subgraph discovery. In: PVLDB, vol.\u00a012, pp. 43\u201356 (2018)","DOI":"10.14778\/3275536.3275540"},{"key":"942_CR63","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: WWW, pp. 927\u2013937 (2015)","DOI":"10.1145\/2736277.2741640"},{"issue":"1","key":"942_CR64","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"key":"942_CR65","doi-asserted-by":"crossref","unstructured":"Shi, J., Dhulipala, L., Shun, J.: Theoretically and practically efficient parallel nucleus decomposition. In: PVLDB, vol.\u00a015, pp. 583\u2013596 (2021)","DOI":"10.14778\/3494124.3494140"},{"key":"942_CR66","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD, pp. 939\u2013948. ACM (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"942_CR67","doi-asserted-by":"crossref","unstructured":"Sun, B., Danisch, M., Chan, T.H., Sozio, M.: Kclist++: A simple algorithm for finding k-clique densest subgraphs in large graphs. In: PVLDB, vol.\u00a013, pp. 1628\u20131640 (2020)","DOI":"10.14778\/3401960.3401962"},{"issue":"9","key":"942_CR68","first-page":"4313","volume":"34","author":"L Sun","year":"2022","unstructured":"Sun, L., Huang, X., Li, R., Choi, B., Xu, J.: Index-based intimate-core community search in large weighted graphs. IEEE TKDE 34(9), 4313\u20134327 (2022)","journal-title":"IEEE TKDE"},{"issue":"2","key":"942_CR69","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SICOMP 1(2), 146\u2013160 (1972)","journal-title":"SICOMP"},{"key":"942_CR70","doi-asserted-by":"crossref","unstructured":"Tatti, N.: Density-friendly graph decomposition. TKDD 13(5), 54:1\u201354:29 (2019)","DOI":"10.1145\/3344210"},{"key":"942_CR71","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: The k-clique densest subgraph problem. In: WWW, pp. 1122\u20131132 (2015)","DOI":"10.1145\/2736277.2741098"},{"issue":"1\u20133","key":"942_CR72","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2003.07.007","volume":"143","author":"V Venkateswaran","year":"2004","unstructured":"Venkateswaran, V.: Minimizing maximum indegree. Discret. Appl. Math. 143(1\u20133), 374\u2013378 (2004)","journal-title":"Discret. Appl. Math."},{"key":"942_CR73","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. In: PVLDB, vol.\u00a05, pp. 812\u2013823 (2012)","DOI":"10.14778\/2311906.2311909"},{"key":"942_CR74","doi-asserted-by":"crossref","unstructured":"Xu, Y., Ma, C., Fang, Y., Bao, Z.: Efficient and effective algorithms for generalized densest subgraph discovery. SIGMOD 1(2), 169:1\u2013169:27 (2023)","DOI":"10.1145\/3589314"},{"issue":"11","key":"942_CR75","first-page":"2722","volume":"17","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Li, R., Zhang, Q., Qin, H., Qin, L., Wang, G.: Efficient algorithms for pseudoarboricity computation in large static and dynamic graphs. PVLDB 17(11), 2722\u20132734 (2024)","journal-title":"PVLDB"},{"issue":"11","key":"942_CR76","first-page":"2933","volume":"17","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Li, R., Zhang, Q., Qin, H., Wang, G.: Efficient algorithms for density decomposition on large static and dynamic graphs. PVLDB 17(11), 2933\u20132945 (2024)","journal-title":"PVLDB"},{"key":"942_CR77","doi-asserted-by":"crossref","unstructured":"Zhao, F., Tung, A.K.H.: Large scale cohesive subgraphs discovery for social network visual analysis. In: PVLDB, vol.\u00a06, pp. 85\u201396 (2012)","DOI":"10.14778\/2535568.2448942"},{"key":"942_CR78","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2017.07.012","volume":"417","author":"Z Zheng","year":"2017","unstructured":"Zheng, Z., Ye, F., Li, R., Ling, G., Jin, T.: Finding weighted k-truss communities in large networks. Inf. Sci. 417, 344\u2013360 (2017)","journal-title":"Inf. Sci."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00942-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00942-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00942-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:14:35Z","timestamp":1765530875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00942-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":78,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["942"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00942-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"4 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"63"}}