{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T13:01:45Z","timestamp":1785502905050,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770854.3780186","type":"proceedings-article","created":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T12:07:40Z","timestamp":1785499660000},"page":"783-794","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerated Coordinate Descent for Directed Densest Subgraph Discovery"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3669-0022","authenticated-orcid":false,"given":"Luocheng","family":"Liang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5630-6822","authenticated-orcid":false,"given":"Yingli","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5047-8593","authenticated-orcid":false,"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Diameter of the world-wide web. nature","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, Vol. 401, 6749 (1999), 130-131."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0340-z"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Francis Bach et al. 2013. Learning with submodular functions: A convex optimization perspective. Foundations and Trends\u00ae in machine learning Vol. 6 2-3 (2013) 145-373.","DOI":"10.1561\/2200000039"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_2_7_1","first-page":"379","article-title":"Finding subgraphs with maximum total density and limited overlap","author":"Balalau Oana Denisa","year":"2015","unstructured":"Oana Denisa Balalau, Francesco Bonchi, TH Hubert Chan, Francesco Gullo, and Mauro Sozio. 2015. Finding subgraphs with maximum total density and limited overlap. In WSDM. 379-388.","journal-title":"WSDM."},{"key":"e_1_3_2_2_8_1","first-page":"119","article-title":"Copycatch: stopping group attacks by spotting lockstep behavior in social networks","author":"Beutel Alex","year":"2013","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-130.","journal-title":"WWW."},{"key":"e_1_3_2_2_9_1","first-page":"173","article-title":"Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams","author":"Bhattacharya Sayan","year":"2015","unstructured":"Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Charalampos Tsourakakis. 2015. Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In STOC. 173-182.","journal-title":"STOC."},{"key":"e_1_3_2_2_10_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_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_2_12_1","volume-title":"Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, and Chris Schwiegelshohn.","author":"Chekuri Chandra","year":"2024","unstructured":"Chandra Chekuri, Aleksander Bj\u00f8rn Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, and Chris Schwiegelshohn. 2024. Adaptive out-orientations with applications. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, 3062-3088."},{"key":"e_1_3_2_2_13_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-1555."},{"key":"e_1_3_2_2_14_1","first-page":"1200","article-title":"Anchored Densest Subgraph","author":"Dai Yizhou","year":"2022","unstructured":"Yizhou Dai, Miao Qiao, and Lijun Chang. 2022. Anchored Densest Subgraph. In SIGMOD. 1200-1213.","journal-title":"SIGMOD."},{"key":"e_1_3_2_2_15_1","first-page":"233","article-title":"Large scale density-friendly graph decomposition via convex programming","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-242.","journal-title":"WWW."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045203"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554895"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_2_19_1","unstructured":"Uriel Feige Michael Seltser et al. 1997. On the densest k-subgraph problem. Citeseer."},{"key":"e_1_3_2_2_20_1","unstructured":"Olivier Fercoq and Peter Richt\u00e1rik. 2014. Accelerated Parallel and Proximal Coordinate Descent. arXiv:1312.5799 [math.OC] https:\/\/arxiv.org\/abs\/1312.5799"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_2_22_1","first-page":"2313","article-title":"Dense subgraph discovery: Kdd 2015 tutorial","author":"Gionis Aristides","year":"2015","unstructured":"Aristides Gionis and Charalampos E Tsourakakis. 2015. Dense subgraph discovery: Kdd 2015 tutorial. In SIGKDD. 2313-2314.","journal-title":"SIGKDD."},{"key":"e_1_3_2_2_23_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_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Elfarouk Harb Kent Quanrud and Chandra Chekuri. 2022. Faster and Scalable Algorithms for Densest Subgraph and Decomposition. In NIPS.","DOI":"10.52202\/068431-1955"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588923"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"key":"e_1_3_2_2_27_1","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"Jaggi Martin","year":"2013","unstructured":"Martin Jaggi. 2013. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In ICML. PMLR, 427-435.","journal-title":"ICML. PMLR"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348556"},{"key":"e_1_3_2_2_29_1","unstructured":"Ravindran Kannan and V Vinay. 1999. Analyzing the structure of large graphs. Forschungsinst. f\u00fcr Diskrete Mathematik."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_2_31_1","unstructured":"Konect. 2006. Konect. http:\/\/konect.cc\/networks\/."},{"key":"e_1_3_2_2_32_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_3_2_2_33_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. 2023a. A Survey of Densest Subgraph Discovery on Large Graphs. arXiv preprint arXiv:2306.07927 (2023)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00029"},{"key":"e_1_3_2_2_35_1","volume-title":"Efficient Influential Community Search in Large Uncertain Graphs. TKDE","author":"Luo Wensheng","year":"2021","unstructured":"Wensheng Luo, Xu Zhou, Kenli Li, Yunjun Gao, and Keqin Li. 2021. Efficient Influential Community Search in Large Uncertain Graphs. TKDE (2021)."},{"key":"e_1_3_2_2_36_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. 2022a. Finding locally densest subgraphs: a convex programming approach. PVLDB, Vol. 15, 11 (2022), 2719-2732.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_37_1","first-page":"845","article-title":"A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery","author":"Ma Chenhao","year":"2022","unstructured":"Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, and Xiaolin Han. 2022b. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery. In SIGMOD. 845-859.","journal-title":"SIGMOD."},{"key":"e_1_3_2_2_38_1","first-page":"1051","article-title":"Efficient algorithms for densest subgraph discovery on large directed graphs","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-1066.","journal-title":"SIGMOD."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471485.3471494"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483940"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599306"},{"key":"e_1_3_2_2_42_1","volume-title":"Multiplicative weights update, area convexity and random coordinate descent for densest subgraph problems. arXiv preprint arXiv:2405.18809","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. arXiv preprint arXiv:2405.18809 (2024)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645647"},{"key":"e_1_3_2_2_44_1","unstructured":"Laboratory of Web Algorithmics. 2013. Laboratory of Web Algorithmics Datasets. http:\/\/law.di.unimi.it\/datasets.php."},{"key":"e_1_3_2_2_45_1","unstructured":"Stanford Network Analysis Project. 2009. SNAP. http:\/\/snap.stanford.edu\/data\/."},{"key":"e_1_3_2_2_46_1","first-page":"965","article-title":"Locally densest subgraph discovery","author":"Qin Lu","year":"2015","unstructured":"Lu Qin, Rong-Hua Li, Lijun Chang, and Chengqi Zhang. 2015. Locally densest subgraph discovery. In KDD. 965-974.","journal-title":"KDD."},{"key":"e_1_3_2_2_47_1","unstructured":"Network Repository. 2014. Network Repository. https:\/\/networkrepository.com\/network-data.php."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"e_1_3_2_2_49_1","first-page":"181","article-title":"Near-optimal fully dynamic densest subgraph","author":"Sawlani Saurabh","year":"2020","unstructured":"Saurabh Sawlani and Junxing Wang. 2020. Near-optimal fully dynamic densest subgraph. In STOC. 181-193.","journal-title":"STOC."},{"key":"e_1_3_2_2_50_1","unstructured":"The source code. 2025. Source code of our paper. https:\/\/github.com\/NotDesigned\/RACDDS."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_54_1","first-page":"104","article-title":"Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees","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 SIGKDD. 104-112.","journal-title":"SIGKDD."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589314"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671727"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3677129"},{"key":"e_1_3_2_2_58_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. 2024b. In-depth Analysis of Densest Subgraph Discovery in a Unified Framework. arXiv preprint arXiv:2406.04738 (2024)."}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3770854.3780186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T12:10:43Z","timestamp":1785499843000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770854.3780186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,20]]},"references-count":58,"alternative-id":["10.1145\/3770854.3780186","10.1145\/3770854"],"URL":"https:\/\/doi.org\/10.1145\/3770854.3780186","relation":{},"subject":[],"published":{"date-parts":[[2026,4,20]]},"assertion":[{"value":"2026-04-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}