{"id":"https://openalex.org/W4417070810","doi":"https://doi.org/10.1145/3769785","title":"Efficient and Scalable Directed Densest Subgraph Discovery","display_name":"Efficient and Scalable Directed Densest Subgraph Discovery","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W4417070810","doi":"https://doi.org/10.1145/3769785"},"language":"en","primary_location":{"id":"doi:10.1145/3769785","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769785","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3769785?download=true","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3769785?download=true","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","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, China"],"raw_orcid":"https://orcid.org/0009-0008-5630-6822","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","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, China"],"raw_orcid":"https://orcid.org/0009-0007-3669-0022","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, 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, China"],"raw_orcid":"https://orcid.org/0000-0002-5047-8593","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, 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":2.4401,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.91060845,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.8043000102043152,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.8043000102043152,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.04149999842047691,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.03830000013113022,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7275000214576721},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6452999711036682},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6377000212669373},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4690999984741211},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.46129998564720154},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43709999322891235},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3774999976158142}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7275000214576721},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6452999711036682},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6377000212669373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5806000232696533},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4690999984741211},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.46129998564720154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46059998869895935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.430400013923645},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37299999594688416},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2596000134944916},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769785","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769785","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3769785?download=true","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3769785","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769785","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3769785?download=true","source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320331102","display_name":"Shenzhen Research Institute of Big Data","ror":"https://ror.org/00z1gwf89"},{"id":"https://openalex.org/F4320333998","display_name":"Shenzhen Research Institute, City University of Hong Kong","ror":"https://ror.org/00xc0ma20"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417070810.pdf","grobid_xml":"https://content.openalex.org/works/W4417070810.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1783487834","https://openalex.org/W1924929788","https://openalex.org/W1994924587","https://openalex.org/W2032279394","https://openalex.org/W2046804949","https://openalex.org/W2121526866","https://openalex.org/W2160556205","https://openalex.org/W2170569385","https://openalex.org/W2259724869","https://openalex.org/W2266714125","https://openalex.org/W2620706275","https://openalex.org/W2953102514","https://openalex.org/W3004777475","https://openalex.org/W3175911760","https://openalex.org/W4312389781","https://openalex.org/W4317639443","https://openalex.org/W4383749545","https://openalex.org/W4392453911","https://openalex.org/W4399174484","https://openalex.org/W4413985126"],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,15,37,91,101],"directed":[2,7],"graph":[3,93],"G":[4,18,29],",":[5,19],"the":[6,23,98,130,187],"densest":[8],"subgraph":[9,16],"(DDS)":[10],"problem":[11,33],"refers":[12],"to":[13,36,128,135,180],"finding":[14],"from":[17],"whose":[20],"density":[21],"is":[22,34],"highest":[24],"among":[25],"all":[26],"subgraphs":[27],"of":[28,40,160,183],".":[30],"The":[31,171],"DDS":[32,52,75,99,138],"fundamental":[35],"wide":[38],"range":[39],"applications,":[41],"such":[42],"as":[43],"fake":[44],"follower":[45],"detection":[46],"and":[47,59,72,81,120,166],"community":[48],"mining.":[49],"However,":[50],"existing":[51],"solutions":[53],"often":[54],"incur":[55],"significant":[56],"redundant":[57],"computations":[58],"have":[60,154],"weaker":[61],"theoretical":[62,107],"guarantees.":[63,108],"To":[64],"tackle":[65],"these":[66],"issues,":[67],"we":[68,88,141],"present":[69],"both":[70,79],"practically":[71],"theoretically":[73,121],"efficient":[74,113,144],"discovery":[76],"algorithms":[77,177],"(including":[78],"approximation":[80,114,137,151],"exact":[82,145],"methods)":[83],"in":[84],"this":[85,149],"paper.":[86],"Specifically,":[87],"first":[89],"introduce":[90],"novel":[92,150],"reduction":[94],"technique":[95],"that":[96,123,174],"locates":[97],"into":[100],"highly":[102],"smaller":[103],"subgraph,":[104],"with":[105],"non-trivial":[106],"We":[109,153],"further":[110],"develop":[111],"an":[112,143,156],"algorithm":[115,146],"by":[116],"employing":[117],"gradient":[118],"projection":[119],"prove":[122],"it":[124],"requires":[125],"fewer":[126],"iterations":[127],"achieve":[129],"same":[131],"solution":[132],"accuracy":[133],"compared":[134],"state-of-the-art":[136],"algorithms.":[139],"Finally,":[140],"propose":[142],"based":[147],"on":[148,163],"algorithm.":[152],"performed":[155],"extensive":[157],"empirical":[158],"evaluation":[159],"our":[161,175],"approaches":[162],"15":[164],"real":[165],"8":[167],"synthetic":[168],"large":[169],"datasets.":[170],"results":[172],"show":[173],"proposed":[176],"are":[178],"up":[179],"two":[181],"orders":[182],"magnitude":[184],"faster":[185],"than":[186],"state-of-the-art.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-12-06T00:00:00"}