{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T04:29:49Z","timestamp":1747801789840,"version":"3.41.0"},"reference-count":100,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:p>\n            As a fundamental topic in graph mining,\n            <jats:italic>Densest Subgraph Discovery (DSD)<\/jats:italic>\n            has found a wide spectrum of real applications. Several DSD algorithms, including exact and approximation algorithms, have been proposed in the literature. However, these algorithms have not been systematically and comprehensively compared under the same experimental settings. In this paper, we first summarize a unified framework to incorporate all DSD algorithms from a high-level perspective. We then extensively compare representative DSD algorithms over a range of graphs - from small to billion-scale - and examine the effectiveness of all methods, providing a thorough analysis of DSD algorithms. As a byproduct of our experimental analysis, we are also able to identify new variants of the DSD algorithms over undirected graphs, by combining existing techniques, which are up to 10\u00d7 faster than the state-of-the-art algorithm with the same accuracy guarantee. Finally, based on the findings, we offer promising research opportunities. We believe that a deeper understanding of the behavior of existing algorithms can provide new valuable insights for future research.\n          <\/jats:p>","DOI":"10.14778\/3717755.3717771","type":"journal-article","created":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T15:51:49Z","timestamp":1747756309000},"page":"1131-1144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["In-Depth Analysis of Densest Subgraph Discovery in a Unified Framework"],"prefix":"10.14778","volume":"18","author":[{"given":"Yingli","family":"Zhou","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingshuo","family":"Guo","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenhao","family":"Ma","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,20]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Mauricio GC Resende, and Sandra Sudarsky","author":"Abello James","year":"2002","unstructured":"James Abello, Mauricio GC Resende, and Sandra Sudarsky. 2002. Massive quasi-clique detection. In LATIN. Springer, 598\u2013612."},{"key":"e_1_2_1_2_1","volume-title":"Diameter of the world-wide web. nature 401, 6749","author":"Albert R\u00e9ka","year":"1999","unstructured":"R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Diameter of the world-wide web. nature 401, 6749 (1999), 130\u2013131."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824780"},{"key":"e_1_2_1_5_1","volume-title":"Finding dense subgraphs with size bounds","author":"Andersen Reid","unstructured":"Reid Andersen and Kumar Chellapilla. 2009. Finding dense subgraphs with size bounds. In WAW. Springer, 25\u201337."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_2_1_7_1","volume-title":"Densest Subgraph in Streaming and MapReduce. PVLDB 5, 5","author":"Bahmani Bahman","year":"2012","unstructured":"Bahman Bahmani, Ravi Kumar, and Sergei Vassilvitskii. 2012. Densest Subgraph in Streaming and MapReduce. PVLDB 5, 5 (2012)."},{"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":"crossref","unstructured":"Alex Beutel Wanhong Xu Venkatesan Guruswami Christopher Palow and Christos Faloutsos. 2013. Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In WWW. 119\u2013130.","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Aditya Bhaskara Moses Charikar Eden Chlamtac Uriel Feige and Aravindan Vijayaraghavan. 2010. Detecting high log-densities: an O (n 1\/4) approximation for densest k-subgraph. In STOC. 201\u2013210.","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_2_1_12_1","volume-title":"Polynomial integrality gaps for strong sdp relaxations of densest k-subgraph","author":"Bhaskara Aditya","unstructured":"Aditya Bhaskara, Moses Charikar, Venkatesan Guruswami, Aravindan Vijayaraghavan, and Yuan Zhou. 2012. Polynomial integrality gaps for strong sdp relaxations of densest k-subgraph. In SODA. SIAM, 388\u2013405."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.08.032"},{"key":"e_1_2_1_14_1","volume-title":"Flowless: Extracting densest subgraphs without flow computations. In WWW.","author":"Boob Digvijay","year":"2020","unstructured":"Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos Tsourakakis, Di Wang, and Junxing Wang. 2020. Flowless: Extracting densest subgraphs without flow computations. In WWW."},{"key":"e_1_2_1_15_1","volume-title":"Exact and approximation algorithms for densest k-subgraph","author":"Bourgeois Nicolas","unstructured":"Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, and Vangelis Th Paschos. 2013. Exact and approximation algorithms for densest k-subgraph. In WALCOM. Springer, 114\u2013125."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_2_1_17_1","volume-title":"Densest Subgraph: Supermodularity, Iterative Peeling, and Flow","author":"Chekuri Chandra","year":"2022","unstructured":"Chandra Chekuri, Kent Quanrud, and Manuel R Torres. 2022. Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. In SODA. SIAM, 1531\u20131555."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_2_1_21_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_22_1","doi-asserted-by":"crossref","unstructured":"Yizhou Dai Miao Qiao and Lijun Chang. 2022. Anchored Densest Subgraph. In SIGMOD. 1200\u20131213.","DOI":"10.1145\/3514221.3517890"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Maximilien Danisch Oana Balalau and Mauro Sozio. 2018. Listing k-cliques in sparse real-world graphs. In WWW. 589\u2013598.","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_2_1_24_1","volume-title":"T-H Hubert Chan, and Mauro Sozio","author":"Danisch Maximilien","year":"2017","unstructured":"Maximilien Danisch, T-H Hubert Chan, and Mauro Sozio. 2017. Large scale density-friendly graph decomposition via convex programming. In WWW. 233\u2013242."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00077"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Danhao Ding Hui Li Zhipeng Huang and Nikos Mamoulis. 2017. Efficient fault-tolerant group recommendation using alpha-beta-core. In CIKM. 2047\u20132050.","DOI":"10.1145\/3132847.3133130"},{"key":"e_1_2_1_27_1","volume-title":"Improved Differentially Private Densest Subgraph: Local and Purely Additive. arXiv preprint arXiv:2308.10316","author":"Dinitz Michael","year":"2023","unstructured":"Michael Dinitz, Satyen Kale, Silvio Lattanzi, and Sergei Vassilvitskii. 2023. Improved Differentially Private Densest Subgraph: Local and Purely Additive. arXiv preprint arXiv:2308.10316 (2023)."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554895"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2872982"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_2_1_32_1","unstructured":"Uriel Feige Michael Seltser et al. 1997. On the densest k-subgraph problem. Citeseer."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Edoardo Galimberti Francesco Bonchi and Francesco Gullo. 2017. Core decomposition and densest subgraph in multilayer networks. In CIKM. 1807\u20131816.","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369872"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-012-0539-0"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Aristides Gionis and Charalampos E Tsourakakis. 2015. Dense subgraph discovery: Kdd 2015 tutorial. In SIGKDD. 2313\u20132314.","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_2_1_38_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph. University of California Berkeley."},{"key":"e_1_2_1_39_1","volume-title":"The Densest k Subgraph Problem in b-Outerplanar Graphs","author":"Gonzales Sean","unstructured":"Sean Gonzales and Theresa Migler. 2019. The Densest k Subgraph Problem in b-Outerplanar Graphs. In COMPLEX NETWORKS. Springer, 116\u2013127."},{"key":"e_1_2_1_40_1","unstructured":"Elfarouk Harb Kent Quanrud and Chandra Chekuri. 2022. Faster and Scalable Algorithms for Densest Subgraph and Decomposition. In NIPS."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588923"},{"key":"e_1_2_1_42_1","volume-title":"Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos.","author":"Hooi Bryan","year":"2016","unstructured":"Bryan Hooi, Hyun Ah Song, Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos. 2016. Fraudar: Bounding graph fraud in the face of camouflage. In SIGKDD. 895\u2013904."},{"key":"e_1_2_1_43_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_44_1","unstructured":"Martin Jaggi. 2013. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In ICML. PMLR 427\u2013435."},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Akshay Java Xiaodan Song Tim Finin and Belle Tseng. 2007. Why we twitter: understanding microblogging usage and communities. In WebKDD\/SNA-KDD. 56\u201365.","DOI":"10.1145\/1348549.1348556"},{"key":"e_1_2_1_46_1","volume-title":"Finding dense subgraphs in relational graphs","author":"Jethava Vinay","unstructured":"Vinay Jethava and Niko Beerenwinkel. 2015. Finding dense subgraphs in relational graphs. In ECML PKDD. Springer, 641\u2013654."},{"key":"e_1_2_1_47_1","unstructured":"Ravindran Kannan and V Vinay. 1999. Analyzing the structure of large graphs. Forschungsinst. f\u00fcr Diskrete Mathematik."},{"key":"e_1_2_1_48_1","volume-title":"Modelling and analysis of gene regulatory networks. Nature reviews Molecular cell biology 9, 10","author":"Karlebach Guy","year":"2008","unstructured":"Guy Karlebach and Ron Shamir. 2008. Modelling and analysis of gene regulatory networks. Nature reviews Molecular cell biology 9, 10 (2008), 770\u2013780."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288645.3288671"},{"key":"e_1_2_1_50_1","volume-title":"On finding dense subgraphs","author":"Khuller Samir","unstructured":"Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In ICALP. Springer, 597\u2013608."},{"key":"e_1_2_1_51_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_52_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_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529340"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00606-9"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Qing Liu Minjun Zhao Xin Huang Jianliang Xu and Yunjun Gao. 2020. Truss-based community search over large directed graphs. In SIGMOD. 2183\u20132197.","DOI":"10.1145\/3318464.3380587"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3675034.3675054"},{"key":"e_1_2_1_57_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_58_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_59_1","volume-title":"Scalable Algorithms for Densest Subgraph Discovery","author":"Luo Wensheng","unstructured":"Wensheng Luo, Zhuo Tang, Yixiang Fang, Chenhao Ma, and Xu Zhou. 2023. Scalable Algorithms for Densest Subgraph Discovery. In ICDE. IEEE."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397234"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_2_1_62_1","first-page":"2719","article-title":"Finding locally densest subgraphs: a convex programming approach","volume":"15","author":"Ma Chenhao","year":"2022","unstructured":"Chenhao Ma, Reynold Cheng, Laks VS Lakshmanan, and Xiaolin Han. 2022. Finding locally densest subgraphs: a convex programming approach. PVLDB 15, 11 (2022), 2719\u20132732.","journal-title":"PVLDB"},{"key":"e_1_2_1_63_1","volume-title":"Laks VS Lakshmanan, and Xiaolin Han","author":"Ma Chenhao","year":"2022","unstructured":"Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, and Xiaolin Han. 2022. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery. In SIGMOD. 845\u2013859."},{"key":"e_1_2_1_64_1","volume-title":"Xiaolin Han, and Xiaodong Li.","author":"Ma Chenhao","year":"2023","unstructured":"Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, Xiaolin Han, and Xiaodong Li. 2023. Accelerating directed densest subgraph queries with software and hardware approaches. The VLDB Journal (2023), 1\u201324."},{"key":"e_1_2_1_65_1","volume-title":"Wenjie Zhang, and Xuemin Lin.","author":"Ma Chenhao","year":"2020","unstructured":"Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, Wenjie Zhang, and Xuemin Lin. 2020. Efficient algorithms for densest subgraph discovery on large directed graphs. In SIGMOD. 1051\u20131066."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471485.3471494"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483940"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"Michael Mitzenmacher Jakub Pachocki Richard Peng Charalampos Tsourakakis and Shen Chen Xu. 2015. Scalable large near-clique detection in large-scale networks via sampling. In SIGKDD. 815\u2013824.","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599306"},{"key":"e_1_2_1_70_1","volume-title":"Robust densest subgraph discovery","author":"Miyauchi Atsushi","unstructured":"Atsushi Miyauchi and Akiko Takeda. 2018. Robust densest subgraph discovery. In ICDM. IEEE, 1188\u20131193."},{"key":"e_1_2_1_71_1","unstructured":"nebula. 2010. nebula. https:\/\/www.nebula-graph.io\/."},{"key":"e_1_2_1_72_1","unstructured":"neo4j. 2006. neo4j. https:\/\/neo4j.com\/."},{"key":"e_1_2_1_73_1","volume-title":"Dokl. Akad. Nauk SSSR","author":"Nesterov Yu E","unstructured":"Yu E Nesterov. 1983. A method for solving the convex programming problem with convergence rate O(1\/k2). In Dokl. Akad. Nauk SSSR,, Vol. 269. 543\u2013547."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9956-7"},{"key":"e_1_2_1_75_1","unstructured":"Laboratory of Web Algorithmics. 2013. Laboratory of Web Algorithmics Datasets. http:\/\/law.di.unimi.it\/datasets.php."},{"key":"e_1_2_1_76_1","unstructured":"Stanford Network Analysis Project. 2009. SNAP. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_2_1_77_1","doi-asserted-by":"crossref","unstructured":"Lu Qin Rong-Hua Li Lijun Chang and Chengqi Zhang. 2015. Locally densest subgraph discovery. In KDD. 965\u2013974.","DOI":"10.1145\/2783258.2783299"},{"key":"e_1_2_1_78_1","unstructured":"The Technique Report. 2024. In-depth Analysis of Densest Subgraph Discovery in a Unified Framework (technical report). https:\/\/github.com\/TalionS\/DensestSubgraph\/blob\/master\/full_version.pdf."},{"key":"e_1_2_1_79_1","unstructured":"Network Repository. 2014. Network Repository. https:\/\/networkrepository.com\/network-data.php."},{"key":"e_1_2_1_80_1","volume-title":"Dense subgraphs with restrictions and applications to gene annotation graphs","author":"Saha Barna","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 RECOMB. Springer, 456\u2013472."},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.11.3304"},{"key":"e_1_2_1_82_1","doi-asserted-by":"crossref","unstructured":"Saurabh Sawlani and Junxing Wang. 2020. Near-optimal fully dynamic densest subgraph. In STOC. 181\u2013193.","DOI":"10.1145\/3357713.3384327"},{"key":"e_1_2_1_83_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_84_1","volume-title":"Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). SIAM, 59\u201373","author":"Sukprasert Pattara","year":"2024","unstructured":"Pattara Sukprasert, Quanquan C Liu, Laxman Dhulipala, and Julian Shun. 2024. Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). SIAM, 59\u201373."},{"key":"e_1_2_1_85_1","volume-title":"A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. PVLDB","author":"Sun Bintao","year":"2020","unstructured":"Bintao Sun, Maximilien Danisch, TH Chan, and Mauro Sozio. 2020. KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. PVLDB (2020)."},{"key":"e_1_2_1_86_1","unstructured":"tigergraph. 2010. tigergraph. https:\/\/www.tigergraph.com\/."},{"key":"e_1_2_1_87_1","doi-asserted-by":"crossref","unstructured":"Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW. 1122\u20131132.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_2_1_88_1","doi-asserted-by":"crossref","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 SIGKDD. 104\u2013112.","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_2_1_89_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_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467398"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00658-5"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589314"},{"key":"e_1_2_1_93_1","doi-asserted-by":"crossref","unstructured":"Kaiqiang Yu Cheng Long Shengxin Liu and Da Yan. 2022. Efficient Algorithms for Maximal k-Biplex Enumeration. In SIGMOD. ACM 860\u2013873.","DOI":"10.1145\/3514221.3517847"},{"key":"e_1_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0451-4"},{"key":"e_1_2_1_95_1","volume-title":"Extracting analyzing and visualizing triangle k-core motifs within networks","author":"Zhang Yang","unstructured":"Yang Zhang and Srinivasan Parthasarathy. 2012. Extracting analyzing and visualizing triangle k-core motifs within networks. In ICDE. IEEE, 1049\u20131060."},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594532"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681975"},{"key":"e_1_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3677129"},{"key":"e_1_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17477"},{"key":"e_1_2_1_100_1","volume-title":"Bitruss decomposition of bipartite graphs","author":"Zou Zhaonian","unstructured":"Zhaonian Zou. 2016. Bitruss decomposition of bipartite graphs. In DASFAA. Springer, 218\u2013233."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3717755.3717771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T16:16:39Z","timestamp":1747757799000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3717755.3717771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":100,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.14778\/3717755.3717771"],"URL":"https:\/\/doi.org\/10.14778\/3717755.3717771","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"2025-05-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}