{"id":"https://openalex.org/W7171962197","doi":"https://doi.org/10.1145/3770854.3780186","title":"Accelerated Coordinate Descent for Directed Densest Subgraph Discovery","display_name":"Accelerated Coordinate Descent for Directed Densest Subgraph Discovery","publication_year":2026,"publication_date":"2026-04-20","ids":{"openalex":"https://openalex.org/W7171962197","doi":"https://doi.org/10.1145/3770854.3780186"},"language":null,"primary_location":{"id":"doi:10.1145/3770854.3780186","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3770854.3780186","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3770854.3780186","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110045333","display_name":"Liu Qing Liang","orcid":"https://orcid.org/0009-0007-3669-0022"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luocheng Liang","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0009-0007-3669-0022","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056279274","display_name":"Yingli Zhou","orcid":"https://orcid.org/0009-0008-5630-6822"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yingli Zhou","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0009-0008-5630-6822","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043494334","display_name":"Yixiang Fang","orcid":"https://orcid.org/0000-0002-5047-8593"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yixiang Fang","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0000-0002-5047-8593","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210116924"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"783","last_page":"794"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5683000087738037},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5565000176429749},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.5069000124931335},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.41040000319480896},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4083999991416931},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3977000117301941},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.387800008058548}],"concepts":[{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5683000087738037},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5565000176429749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5206999778747559},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5202000141143799},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.5069000124931335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44130000472068787},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4083999991416931},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3977000117301941},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.387800008058548},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3767000138759613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36500000953674316},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2824000120162964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2750000059604645},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2587999999523163},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3770854.3780186","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3770854.3780186","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3770854.3780186","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3770854.3780186","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1500512125","https://openalex.org/W1502940150","https://openalex.org/W1888358353","https://openalex.org/W1924929788","https://openalex.org/W2046804949","https://openalex.org/W2051109346","https://openalex.org/W2121526866","https://openalex.org/W2266714125","https://openalex.org/W2348679751","https://openalex.org/W2952019053","https://openalex.org/W2953102514","https://openalex.org/W2970828623","https://openalex.org/W3046691040","https://openalex.org/W3094534277","https://openalex.org/W3175911760","https://openalex.org/W3212747350","https://openalex.org/W4312389781","https://openalex.org/W4379539435","https://openalex.org/W4380433246","https://openalex.org/W4381327380","https://openalex.org/W4385318193","https://openalex.org/W4396758675","https://openalex.org/W4401863545","https://openalex.org/W4402969637","https://openalex.org/W7133219024"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,14,34,62,77],"directed":[2,6],"graph":[3],"G,":[4,17],"the":[5,21,82,94,116,154],"densest":[7],"subgraph":[8,15],"(DDS)":[9],"problem":[10,30,84],"refers":[11],"to":[12,33,101,114,121,150],"finding":[13],"from":[16],"whose":[18],"density":[19],"is":[20,31],"highest":[22],"among":[23],"all":[24],"subgraphs":[25],"of":[26,37,133],"G.":[27],"The":[28,141],"DDS":[29,49,67,83,124],"fundamental":[32],"wide":[35],"range":[36],"applications,":[38],"such":[39],"as":[40],"fake":[41],"follower":[42],"detection":[43],"and":[44,85],"community":[45],"mining.":[46],"However,":[47],"existing":[48],"solutions":[50],"often":[51],"provide":[52],"weaker":[53],"theoretical":[54],"guarantees.":[55],"To":[56],"tackle":[57],"these":[58],"issues,":[59],"we":[60,74],"present":[61],"theoretically":[63,106],"efficient":[64,89],"(1+\u03b5)":[65],"approximate":[66],"discovery":[68],"algorithm":[69,91,110],"in":[70],"this":[71],"paper.":[72],"Specifically,":[73],"first":[75],"introduce":[76],"novel":[78],"LP":[79],"formulation":[80],"for":[81],"then":[86],"propose":[87],"an":[88,129],"approximation":[90,123],"based":[92],"on":[93,136],"accelerated":[95],"random":[96],"coordinate":[97],"descent":[98],"method":[99],"(ACDM)":[100],"solve":[102],"it":[103],"efficiently.":[104],"We":[105,126],"prove":[107],"that":[108,144],"our":[109,134,145],"requires":[111],"fewer":[112],"iterations":[113],"achieve":[115],"same":[117],"solution":[118],"accuracy":[119],"compared":[120],"state-of-the-art":[122],"algorithms.":[125],"have":[127],"performed":[128],"extensive":[130],"empirical":[131],"evaluation":[132],"approaches":[135],"15":[137],"real":[138],"large":[139],"datasets.":[140],"results":[142],"show":[143],"proposed":[146],"algorithms":[147],"are":[148],"up":[149],"1000\u00d7":[151],"faster":[152],"than":[153],"current":[155],"state-of-the-art.":[156]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2026-08-01T00:00:00"}