{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T15:32:40Z","timestamp":1786635160666,"version":"3.56.0"},"reference-count":93,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:p>\n            <jats:italic toggle=\"yes\">Densest subgraph discovery (DSD)<\/jats:italic>\n            is a fundamental topic in graph mining. It has been studied for decades, and is widely used in various areas, including network science, biological analysis, and graph databases. As a typical problem of DSD, the\n            <jats:italic toggle=\"yes\">k<\/jats:italic>\n            -clique densest subgraph (CDS) problem aims to detect a subgraph from a graph, such that the number of\n            <jats:italic toggle=\"yes\">k<\/jats:italic>\n            -cliques over the number of its vertices is maximized. While the CDS problem has received plenty of attention in the literature, existing CDS algorithms that perform best in practice often have weaker theoretical guarantees, while those with the stronger theoretical assurances tend to perform worse in practice. Besides, all the existing CDS algorithms struggle with graphs with high degeneracy values, a characteristic commonly found in real-world graphs. To bridge the huge gap between practice and theory, in this paper, we first introduce a novel graph reduction technique, which locates the CDS into a very small subgraph, with non-trivial theoretical guarantees. We further propose a new efficient approximation algorithm by employing the state-of-the-art\n            <jats:italic toggle=\"yes\">k<\/jats:italic>\n            -clique counting algorithm, which shares all the advantages of existing algorithms, achieving both strong practical efficiency and theoretical guarantees. Extensive experiments on 12 real-world large graphs demonstrate the high efficiency of our CDS algorithm. Particularly, our algorithm is up to four orders of magnitude faster than the state-of-the-art algorithm while maintaining the same accuracy guarantees and requiring much less memory.\n          <\/jats:p>","DOI":"10.14778\/3748191.3748210","type":"journal-article","created":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:50:16Z","timestamp":1756993816000},"page":"3490-3503","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient\n            <i>k<\/i>\n            -Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory"],"prefix":"10.14778","volume":"18","author":[{"given":"Yingli","family":"Zhou","sequence":"first","affiliation":[{"name":"The Chinese University of Hong, Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingshuo","family":"Guo","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong, Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong, Kong, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,9,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Venkat Anantharam and Justin Salez. 2016. The densest subgraph problem in sparse random graphs. (2016).","DOI":"10.1214\/14-AAP1091"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0340-z"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00243-8"},{"key":"e_1_2_1_6_1","volume-title":"Densest subgraph in streaming and mapreduce. arXiv preprint arXiv:1201.6567","author":"Bahmani Bahman","year":"2012","unstructured":"Bahman Bahmani, Ravi Kumar, and Sergei Vassilvitskii. 2012. Densest subgraph in streaming and mapreduce. arXiv preprint arXiv:1201.6567 (2012)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"e_1_2_1_9_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380140"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330986"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 1531\u20131555","author":"Chekuri Chandra","year":"2022","unstructured":"Chandra Chekuri, Kent Quanrud, and Manuel R Torres. 2022. Densest subgraph: Supermodularity, iterative peeling, and flow. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 1531\u20131555."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2762\u20132770","author":"Chen Tianyi","year":"2022","unstructured":"Tianyi Chen and Charalampos Tsourakakis. 2022. Antibenford subgraphs: Unsupervised anomaly detection in financial networks. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2762\u20132770."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_2_1_18_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16, 3.1","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16, 3.1 (2008)."},{"key":"e_1_2_1_19_1","volume-title":"An algorithm for finding functional modules and protein complexes in proteinprotein interaction networks. Journal of Biomedicine and Biotechnology 2008","author":"Cui Guangyu","year":"2008","unstructured":"Guangyu Cui, Yu Chen, De-Shuang Huang, and Kyungsook Han. 2008. An algorithm for finding functional modules and protein complexes in proteinprotein interaction networks. Journal of Biomedicine and Biotechnology 2008 (2008)."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 2022 International Conference on Management of Data. 1200\u20131213","author":"Dai Yizhou","year":"2022","unstructured":"Yizhou Dai, Miao Qiao, and Lijun Chang. 2022. Anchored densest subgraph. In Proceedings of the 2022 International Conference on Management of Data. 1200\u20131213."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3651589"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052619"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. 1135\u20131144","author":"Du Xiaoxi","year":"2009","unstructured":"Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E Lee, and John H Thornton Jr. 2009. Migration motif: a spatial-temporal pattern mining approach for financial markets. In Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. 1135\u20131144."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554895"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_2_1_29_1","unstructured":"Uriel Feige Michael Seltser et al. 1997. On the densest k-subgraph problem. Citeseer."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536342"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2313\u20132314","author":"Gionis Aristides","year":"2015","unstructured":"Aristides Gionis and Charalampos E Tsourakakis. 2015. Dense subgraph discovery: Kdd 2015 tutorial. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2313\u20132314."},{"key":"e_1_2_1_34_1","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph. (1984)."},{"key":"e_1_2_1_35_1","first-page":"26966","article-title":"Faster and scalable algorithms for densest subgraph and decomposition","volume":"35","author":"Harb Elfarouk","year":"2022","unstructured":"Elfarouk Harb, Kent Quanrud, and Chandra Chekuri. 2022. Faster and scalable algorithms for densest subgraph and decomposition. Advances in Neural Information Processing Systems 35 (2022), 26966\u201326979.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588923"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Jiafeng Hu Xiaowei Wu Reynold Cheng Siqiang Luo and Yixiang Fang. 2016. Querying minimal steiner maximum-connected subgraphs in large graphs. In CIKM. 1241\u20131250.","DOI":"10.1145\/2983323.2983748"},{"key":"e_1_2_1_39_1","volume-title":"International conference on machine learning. PMLR, 427\u2013435","author":"Jaggi Martin","year":"2013","unstructured":"Martin Jaggi. 2013. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In International conference on machine learning. PMLR, 427\u2013435."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371839"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380264"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. 813\u2013826","author":"Jin Ruoming","year":"2009","unstructured":"Ruoming Jin, Yang Xiang, Ning Ruan, and David Fuhry. 2009. 3-hop: a high-compression indexing scheme for reachability query. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. 813\u2013826."},{"key":"e_1_2_1_43_1","volume-title":"International colloquium on automata, languages, and programming","author":"Khuller Samir","unstructured":"Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International colloquium on automata, languages, and programming. Springer, 597\u2013608."},{"key":"e_1_2_1_44_1","unstructured":"Konect. 2006. Konect. http:\/\/konect.cc\/networks\/."},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Laks VS Lakshmanan. 2022. On a Quest for Combating Filter Bubbles and Misinformation. In SIGMOD. 2\u20132.","DOI":"10.1145\/3514221.3523275"},{"key":"e_1_2_1_46_1","volume-title":"A survey on the densest subgraph problem and its variants. arXiv preprint arXiv:2303.14467","author":"Lanciano Tommaso","year":"2023","unstructured":"Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, and Francesco Bonchi. 2023. A survey on the densest subgraph problem and its variants. arXiv preprint arXiv:2303.14467 (2023)."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3675034.3675054"},{"key":"e_1_2_1_49_1","volume-title":"Maximum Biplex Search over Bipartite Graphs","author":"Luo Wensheng","unstructured":"Wensheng Luo, Kenli Li, Xu Zhou, Yunjun Gao, and Keqin Li. 2022. Maximum Biplex Search over Bipartite Graphs. In ICDE. IEEE, 898\u2013910."},{"key":"e_1_2_1_50_1","volume-title":"A Survey of Densest Subgraph Discovery on Large Graphs. arXiv preprint arXiv:2306.07927","author":"Luo Wensheng","year":"2023","unstructured":"Wensheng Luo, Chenhao Ma, Yixiang Fang, and Laks VS Lakshman. 2023. A Survey of Densest Subgraph Discovery on Large Graphs. arXiv preprint arXiv:2306.07927 (2023)."},{"key":"e_1_2_1_51_1","volume-title":"2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 287\u2013300","author":"Luo Wensheng","year":"2023","unstructured":"Wensheng Luo, Zhuo Tang, Yixiang Fang, Chenhao Ma, and Xu Zhou. 2023. Scalable algorithms for densest subgraph discovery. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 287\u2013300."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617329"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397234"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551826"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517837"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389697"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599306"},{"key":"e_1_2_1_59_1","volume-title":"Area Convexity and Random Coordinate Descent for Densest Subgraph Problems. In Forty-first International Conference on Machine Learning.","author":"Nguyen Ta Duy","year":"2024","unstructured":"Ta Duy Nguyen and Alina Ene. 2024. Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems. In Forty-first International Conference on Machine Learning."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the ACM on Web Conference","author":"Oettershagen Lutz","year":"2024","unstructured":"Lutz Oettershagen, Honglian Wang, and Aristides Gionis. 2024. Finding Densest Subgraphs with Edge-Color Constraints. In Proceedings of the ACM on Web Conference 2024. 936\u2013947."},{"key":"e_1_2_1_61_1","unstructured":"Laboratory of Web Algorithmics. 2013. Laboratory of Web Algorithmics Datasets. http:\/\/law.di.unimi.it\/datasets.php."},{"key":"e_1_2_1_62_1","unstructured":"Stanford Network Analysis Project. 2009. SNAP. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"e_1_2_1_64_1","unstructured":"The Technique Report. 2025. Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory (technical report). https:\/\/github.com\/forxenn\/ccas\/blob\/main\/TechnicalReport.pdf."},{"key":"e_1_2_1_65_1","unstructured":"Network Repository. 2014. Network Repository. https:\/\/networkrepository.com\/network-data.php."},{"key":"e_1_2_1_66_1","volume-title":"Research in Computational Molecular Biology: 14th Annual International Conference, RECOMB 2010, Lisbon, Portugal, April 25\u201328, 2010. Proceedings 14","author":"Saha Barna","year":"2010","unstructured":"Barna Saha, Allison Hoch, Samir Khuller, Louiqa Raschid, and Xiao-Ning Zhang. 2010. Dense subgraphs with restrictions and applications to gene annotation graphs. In Research in Computational Molecular Biology: 14th Annual International Conference, RECOMB 2010, Lisbon, Portugal, April 25\u201328, 2010. Proceedings 14. Springer, 456\u2013472."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.11.3304"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.5555\/3192424.3192431"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384327"},{"key":"e_1_2_1_70_1","volume-title":"Network structure and minimum degree. Social networks 5, 3","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269\u2013287."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_2_1_72_1","volume-title":"Koobface: The evolution of the social botnet. In 2010 eCrime Researchers Summit","author":"Tanner Brian K","year":"2010","unstructured":"Brian K Tanner, Gary Warner, Henry Stern, and Scott Olechowski. 2010. Koobface: The evolution of the social botnet. In 2010 eCrime Researchers Summit. IEEE, 1\u201310."},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the 24th International Conference on World Wide Web. 1089\u20131099","author":"Tatti Nikolaj","year":"2015","unstructured":"Nikolaj Tatti and Aristides Gionis. 2015. Density-friendly graph decomposition. In Proceedings of the 24th International Conference on World Wide Web. 1089\u20131099."},{"key":"e_1_2_1_74_1","volume-title":"The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical computer science 363, 1","author":"Tomita Etsuji","year":"2006","unstructured":"Etsuji Tomita, Akira Tanaka, and Haruhisa Takahashi. 2006. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical computer science 363, 1 (2006), 28\u201342."},{"key":"e_1_2_1_75_1","volume-title":"2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 1\u201313","author":"Trung Tran Ba","year":"2023","unstructured":"Tran Ba Trung, Lijun Chang, Nguyen Tien Long, Kai Yao, and Huynh Thi Thanh Binh. 2023. Verification-free approaches to efficient locally densest subgraph discovery. In 2023 IEEE 39th International Conference on Data Engineering (ICDE). IEEE, 1\u201313."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. 104\u2013112","author":"Tsourakakis Charalampos","year":"2013","unstructured":"Charalampos Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Maria Tsiarli. 2013. 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. 104\u2013112."},{"key":"e_1_2_1_78_1","volume-title":"Mathematical and algorithmic analysis of network and biological data. arXiv preprint arXiv:1407.0375","author":"Tsourakakis Charalampos E","year":"2014","unstructured":"Charalampos E Tsourakakis. 2014. Mathematical and algorithmic analysis of network and biological data. arXiv preprint arXiv:1407.0375 (2014)."},{"key":"e_1_2_1_79_1","volume-title":"A novel approach to finding near-cliques: The triangle-densest subgraph problem. arXiv preprint arXiv:1405.1477","author":"Tsourakakis Charalampos E","year":"2014","unstructured":"Charalampos E Tsourakakis. 2014. A novel approach to finding near-cliques: The triangle-densest subgraph problem. arXiv preprint arXiv:1405.1477 (2014)."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639262"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589314"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512167"},{"key":"e_1_2_1_83_1","unstructured":"Xiaowei Ye Rong-Hua Li Lei Liang Zhizhen Liu Longlong Lin and Guoren Wang. 2024. Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach. (2024) xxx\u2013xxx."},{"key":"e_1_2_1_84_1","volume-title":"Scalable k-clique Densest Subgraph Search. arXiv preprint arXiv:2403.05775","author":"Ye Xiaowei","year":"2024","unstructured":"Xiaowei Ye, Miao Qiao, Rong-Hua Li, Qi Zhang, and Guoren Wang. 2024. Scalable k-clique Densest Subgraph Search. arXiv preprint arXiv:2403.05775 (2024)."},{"key":"e_1_2_1_85_1","volume-title":"Data Science for Fake News: Surveys and Perspectives","author":"Yu Kaiqiang","unstructured":"Kaiqiang Yu and Cheng Long. 2021. Graph Mining Meets Fake News Detection. In Data Science for Fake News: Surveys and Perspectives. Springer, 169\u2013189."},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0451-4"},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448942"},{"key":"e_1_2_1_89_1","first-page":"2047","article-title":"Influential community search over large heterogeneous information networks","volume":"16","author":"Zhou Yingli","year":"2023","unstructured":"Yingli Zhou, Yixiang Fang, Wensheng Luo, and Yunming Ye. 2023. Influential community search over large heterogeneous information networks. VLDB 16, 8 (2023), 2047\u20132060.","journal-title":"VLDB"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681975"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/3677129"},{"key":"e_1_2_1_92_1","volume-title":"In-depth Analysis of Densest Subgraph Discovery in a Unified Framework. arXiv preprint arXiv:2406.04738","author":"Zhou Yingli","year":"2024","unstructured":"Yingli Zhou, Qingshuo Guo, Yi Yang, Yixiang Fang, Chenhao Ma, and Laks Lakshmanan. 2024. In-depth Analysis of Densest Subgraph Discovery in a Unified Framework. arXiv preprint arXiv:2406.04738 (2024)."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17477"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3748191.3748210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:52:18Z","timestamp":1756993938000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3748191.3748210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":93,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["10.14778\/3748191.3748210"],"URL":"https:\/\/doi.org\/10.14778\/3748191.3748210","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"2025-09-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}