{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:51:17Z","timestamp":1770537077232,"version":"3.49.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100017053","name":"National Natural Science Foundation of China-Xinjiang Joint Fund","doi-asserted-by":"publisher","award":["62302421"],"award-info":[{"award-number":["62302421"]}],"id":[{"id":"10.13039\/100017053","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00778-025-00958-0","type":"journal-article","created":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:59:07Z","timestamp":1767495547000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-6787-5146","authenticated-orcid":false,"given":"Yi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenhao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,4]]},"reference":[{"issue":"1","key":"958_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"958_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chellapilla, K.: Finding dense subgraphs with size bounds. In: International workshop on algorithms and models for the web-graph, Springer, pp 25\u201337 (2009)","DOI":"10.1007\/978-3-540-95995-3_3"},{"issue":"2","key":"958_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms 34(2), 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"958_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1\u20133), 15\u201326 (2002)","journal-title":"Discret. Appl. Math."},{"key":"958_CR5","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. arXiv preprint arXiv:1201.6567 (2012)","DOI":"10.14778\/2140436.2140442"},{"key":"958_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The webgraph framework i: Compression techniques. In: Proceedings of the 13th international conference on World Wide Web, ACM, pp 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"958_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In: Proceedings of the 20th international conference on World Wide Web, ACM, pp 587\u2013596 (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"958_CR8","doi-asserted-by":"crossref","unstructured":"Boob, D., Gao, Y., Peng, R., Sawlani, S., Tsourakakis, C., Wang, D., Wang, J.: Flowless: Extracting densest subgraphs without flow computations. Proceedings of The Web Conference 2020, 573\u2013583 (2020)","DOI":"10.1145\/3366423.3380140"},{"key":"958_CR9","doi-asserted-by":"crossref","unstructured":"Chang, L., Qiao, M.: Deconstruct densest subgraphs. Proceedings of The Web Conference 2020, 2747\u20132753 (2020)","DOI":"10.1145\/3366423.3380033"},{"key":"958_CR10","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, Springer, pp 84\u201395 (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"key":"958_CR11","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K., Torres, M.R.: Densest subgraph: Supermodularity, iterative peeling, and flow. In: SODA, SIAM, pp 1531\u20131555 (2022)","DOI":"10.1137\/1.9781611977073.64"},{"issue":"7","key":"958_CR12","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TKDE.2010.271","volume":"24","author":"J Chen","year":"2010","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24(7), 1216\u20131230 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"958_CR13","doi-asserted-by":"crossref","unstructured":"Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., Muthukrishnan, S.: One trillion edges: Graph processing at facebook-scale. Proceedings of the VLDB Endowment 8(12), 1804\u20131815 (2015)","DOI":"10.14778\/2824032.2824077"},{"key":"958_CR14","doi-asserted-by":"crossref","unstructured":"Conte, A., De\u00a0Matteis, T., De\u00a0Sensi, D., Grossi, R., Marino, A., Versari, L.: D2k: scalable community detection in massive networks via small-diameter k-plexes. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 1272\u20131281 (2018)","DOI":"10.1145\/3219819.3220093"},{"key":"958_CR15","doi-asserted-by":"crossref","unstructured":"Danisch, M., Chan, T.H.H., Sozio, M.: Large scale density-friendly graph decomposition via convex programming. In: Proceedings of the 26th International Conference on World Wide Web, pp 233\u2013242 (2017)","DOI":"10.1145\/3038912.3052619"},{"issue":"1","key":"958_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-021-00381-8","volume":"6","author":"R Dondi","year":"2021","unstructured":"Dondi, R., Hosseinzadeh, M.M., Guzzi, P.H.: A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks. Appl. Network Sci. 6(1), 1\u201317 (2021)","journal-title":"Appl. Network Sci."},{"issue":"1","key":"958_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10878-020-00664-3","volume":"41","author":"R Dondi","year":"2021","unstructured":"Dondi, R., Hosseinzadeh, M.M., Mauri, G., Zoppis, I.: Top-k overlapping densest subgraphs: approximation algorithms and computational complexity. J. Comb. Optim. 41(1), 80\u2013104 (2021)","journal-title":"J. Comb. Optim."},{"key":"958_CR18","doi-asserted-by":"crossref","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense communities in the web. In: Proceedings of the 16th international conference on World Wide Web, pp 461\u2013470 (2007)","DOI":"10.1145\/1242572.1242635"},{"key":"958_CR19","doi-asserted-by":"crossref","unstructured":"Fang, Y., Yu, K., Cheng, R., Lakshmanan, L.V., Lin, X.: Efficient algorithms for densest subgraph discovery. Proceedings of the VLDB Endowment 12(11) (2019)","DOI":"10.14778\/3342263.3342645"},{"key":"958_CR20","doi-asserted-by":"crossref","unstructured":"Fang, Y., Yu, K., Cheng, R., Lakshmanan, L.V., Lin, X.: Efficient algorithms for densest subgraph discovery. arXiv preprint arXiv:1906.00341 (2019)","DOI":"10.14778\/3342263.3342645"},{"issue":"1","key":"958_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","journal-title":"VLDB J."},{"key":"958_CR22","doi-asserted-by":"crossref","unstructured":"Fang, Y., Luo, W., Ma, C.: Densest subgraph discovery on large graphs: Applications, challenges, and techniques. Proceedings of the VLDB Endowment 15 (2022)","DOI":"10.14778\/3554821.3554895"},{"issue":"1\u20132","key":"958_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P., et al.: An algorithm for quadratic programming. Naval research logistics quarterly 3(1\u20132), 95\u2013110 (1956)","journal-title":"Naval research logistics quarterly"},{"issue":"14","key":"958_CR24","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: Motifcut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"issue":"5","key":"958_CR25","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1007\/s10618-016-0464-z","volume":"30","author":"E Galbrun","year":"2016","unstructured":"Galbrun, E., Gionis, A., Tatti, N.: Top-k overlapping densest subgraphs. Data Min. Knowl. Disc. 30(5), 1134\u20131165 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"958_CR26","doi-asserted-by":"crossref","unstructured":"Gionis, A., Junqueira, F.P., Leroy, V., Serafini, M., Weber, I.: Piggybacking on social networks. In: VLDB 2013-39th International Conference on Very Large Databases, vol\u00a06, pp 409\u2013420 (2013)","DOI":"10.14778\/2536336.2536342"},{"key":"958_CR27","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. University of California Berkeley (1984)"},{"key":"958_CR28","doi-asserted-by":"crossref","unstructured":"Han, X.: Traffic incident detection: a deep learning framework. In: 2019 20th IEEE International Conference on Mobile Data Management (MDM), IEEE, pp 379\u2013380 (2019)","DOI":"10.1109\/MDM.2019.00-22"},{"key":"958_CR29","doi-asserted-by":"crossref","unstructured":"Han, X., Grubenmann, T., Cheng, R., Wong, S.C., Li, X., Sun, W.: Traffic incident detection: A trajectory-based approach. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), IEEE, pp 1866\u20131869 (2020)","DOI":"10.1109\/ICDE48307.2020.00190"},{"key":"958_CR30","doi-asserted-by":"crossref","unstructured":"Han, X., Cheng, R., Grubenmann, T., Maniu, S., Ma, C., Li, X.: Leveraging contextual graphs for stochastic weight completion in sparse road networks. In: Proceedings of the 2022 SIAM International Conference on Data Mining (SDM), SIAM, pp 64\u201372 (2022)","DOI":"10.1137\/1.9781611977172.8"},{"key":"958_CR31","doi-asserted-by":"crossref","unstructured":"Han, X., Cheng, R., Ma, C., Grubenmann, T.: Deeptea: effective and efficient online time-dependent trajectory outlier detection. Proceedings of the VLDB Endowment 15(7), 1493\u20131505 (2022)","DOI":"10.14778\/3523210.3523225"},{"issue":"100","key":"958_CR32","first-page":"696","volume":"72","author":"X Han","year":"2022","unstructured":"Han, X., Dell\u2019Aglio, D., Grubenmann, T., Cheng, R., Bernstein, A.: A framework for differentially-private knowledge graph embeddings. Journal of Web Semantics 72(100), 696 (2022)","journal-title":"Journal of Web Semantics"},{"key":"958_CR33","doi-asserted-by":"crossref","unstructured":"Hooi, B., Song, H.A., Beutel, A., Shah, N., Shin, K., Faloutsos, C.: Fraudar: Bounding graph fraud in the face of camouflage. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 895\u2013904 (2016)","DOI":"10.1145\/2939672.2939747"},{"key":"958_CR34","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, pp 813\u2013826 (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"958_CR35","unstructured":"Kannan, R., Vinay, V.: Analyzing the structure of large graphs. Forschungsinst. f\u00fcr Diskrete Mathematik (1999)"},{"key":"958_CR36","doi-asserted-by":"crossref","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: International colloquium on automata, languages, and programming, Springer, pp 597\u2013608 (2009)","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"958_CR37","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"958_CR38","doi-asserted-by":"crossref","unstructured":"Li, X., Cheng, R., Chang, K.C.C., Shan, C., Ma, C., Cao, H.: On analyzing graphs with motif-paths. Proceedings of the VLDB Endowment 14(6), 1111\u20131123 (2021)","DOI":"10.14778\/3447689.3447714"},{"key":"958_CR39","doi-asserted-by":"crossref","unstructured":"Ma, C., Cheng, R., Lakshmanan, L.V., Grubenmann, T., Fang, Y., Li, X.: Linc: a motif counting algorithm for uncertain graphs. Proceedings of the VLDB Endowment 13(2), 155\u2013168 (2019)","DOI":"10.14778\/3364324.3364330"},{"key":"958_CR40","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., Zhang, W., Lin, X.: Efficient algorithms for densest subgraph discovery on large directed graphs. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 1051\u20131066 (2020)","DOI":"10.1145\/3318464.3389697"},{"issue":"1","key":"958_CR41","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/3471485.3471494","volume":"50","author":"C Ma","year":"2021","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., Zhang, W., Lin, X.: Efficient directed densest subgraph discovery. ACM SIGMOD Rec. 50(1), 33\u201340 (2021)","journal-title":"ACM SIGMOD Rec."},{"issue":"4","key":"958_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3483940","volume":"46","author":"C Ma","year":"2021","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., Zhang, W., Lin, X.: On directed densest subgraph discovery. ACM Transactions on Database Systems (TODS) 46(4), 1\u201345 (2021)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"958_CR43","doi-asserted-by":"crossref","unstructured":"Ma, C., Fang, Y., Cheng, R., Lakshmanan, L.V., Han, X.: A convex-programming approach for efficient directed densest subgraph discovery. In: Proceedings of the 2022 International Conference on Management of Data, pp 845\u2013859 (2022)","DOI":"10.1145\/3514221.3517837"},{"key":"958_CR44","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pachocki, J., Peng, R., Tsourakakis, C., Xu, S.C.: Scalable large near-clique detection in large-scale networks via sampling. In: KDD, pp 815\u2013824 (2015)","DOI":"10.1145\/2783258.2783385"},{"key":"958_CR45","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in o (nm) time, or better. In: Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pp 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"958_CR46","doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R.H., Chang, L., Zhang, C.: Locally densest subgraph discovery. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 965\u2013974 (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"958_CR47","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI, https:\/\/networkrepository.com (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"958_CR48","doi-asserted-by":"crossref","unstructured":"Saha, B., Hoch, A., Khuller, S., Raschid, L., Zhang, X.N.: Dense subgraphs with restrictions and applications to gene annotation graphs. In: Annual International Conference on Research in Computational Molecular Biology, Springer, pp 456\u2013472 (2010)","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"958_CR49","doi-asserted-by":"crossref","unstructured":"Samusevich, R., Danisch, M., Sozio, M.: Local triangle-densest subgraphs. In: 2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), IEEE, pp 33\u201340 (2016)","DOI":"10.1109\/ASONAM.2016.7752210"},{"key":"958_CR50","doi-asserted-by":"crossref","unstructured":"Sawlani, S., Wang, J.: Near-optimal fully dynamic densest subgraph. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp 181\u2013193 (2020)","DOI":"10.1145\/3357713.3384327"},{"issue":"3","key":"958_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. Social networks 5(3), 269\u2013287 (1983)","journal-title":"Social networks"},{"issue":"6","key":"958_CR52","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.cell.2005.08.029","volume":"122","author":"U Stelzl","year":"2005","unstructured":"Stelzl, U., Worm, U., Lalowski, M., Haenig, C., Brembeck, F.H., Goehler, H., Stroedicke, M., Zenkner, M., Schoenherr, A., Koeppen, S., et al.: A human protein-protein interaction network: a resource for annotating the proteome. Cell 122(6), 957\u2013968 (2005)","journal-title":"Cell"},{"key":"958_CR53","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. Proceedings of the VLDB Endowment (PVLDB) (2020)","DOI":"10.14778\/3401960.3401962"},{"key":"958_CR54","doi-asserted-by":"crossref","unstructured":"Tatti, N., Gionis, A.: Density-friendly graph decomposition. In: Proceedings of the 24th International Conference on World Wide Web, pp 1089\u20131099 (2015)","DOI":"10.1145\/2736277.2741119"},{"key":"958_CR55","doi-asserted-by":"crossref","unstructured":"Trung, T.B., Chang, L., Long, N.T., Yao, K., Binh, H.T.T.: Verification-free approaches to efficient locally densest subgraph discovery. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), IEEE, pp 1\u201313 (2023)","DOI":"10.1109\/ICDE55515.2023.00008"},{"key":"958_CR56","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.: The k-clique densest subgraph problem. In: Proceedings of the 24th international conference on world wide web, pp 1122\u20131132 (2015)","DOI":"10.1145\/2736277.2741098"},{"key":"958_CR57","unstructured":"Tsourakakis, C., Chen, T.: Dense subgraph discovery: Theory and application. In: SDM Tutorial (2021)"},{"key":"958_CR58","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"958_CR59","unstructured":"Tsourakakis, C.E.: A novel approach to finding near-cliques: The triangle-densest subgraph problem. arXiv preprint arXiv:1405.1477 (2014)"},{"key":"958_CR60","doi-asserted-by":"crossref","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. Proceedings of the VLDB Endowment 5(9) (2012)","DOI":"10.14778\/2311906.2311909"},{"key":"958_CR61","doi-asserted-by":"crossref","unstructured":"Xu, X., Liu, H., Lv, X., Wang, Y., Li, D.: An efficient and exact algorithm for locally h-clique densest subgraph discovery. Proceedings of the ACM on Management of Data 2(6), 1\u201326 (2024)","DOI":"10.1145\/3698800"},{"issue":"1","key":"958_CR62","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"958_CR63","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Guo, Q., Fang, Y., Ma, C.: A counting-based approach for efficient k-clique densest subgraph discovery. Proceedings of the ACM on Management of Data 2(3), 1\u201327 (2024)","DOI":"10.1145\/3654922"},{"key":"958_CR64","unstructured":"Zhou, Y., Guo, Q., Yang, Y., Fang, Y., Ma, C., Lakshmanan, L.: x In-depth analysis of densest subgraph discovery in a unified framework. arXiv preprint arXiv:2406.04738 (2012)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00958-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00958-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00958-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:27:34Z","timestamp":1770449254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00958-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["958"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00958-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"19 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"7"}}