{"id":"https://openalex.org/W4281779720","doi":"https://doi.org/10.1145/3514221.3517837","title":"A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery","display_name":"A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery","publication_year":2022,"publication_date":"2022-06-10","ids":{"openalex":"https://openalex.org/W4281779720","doi":"https://doi.org/10.1145/3514221.3517837"},"language":"en","primary_location":{"id":"doi:10.1145/3514221.3517837","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3514221.3517837","pdf_url":null,"source":{"id":"https://openalex.org/S4363608845","display_name":"Proceedings of the 2022 International Conference on Management of Data","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055857919","display_name":"Chenhao Ma","orcid":"https://orcid.org/0000-0002-3243-8512"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]},{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Chenhao Ma","raw_affiliation_strings":["The University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"]}]},{"author_position":"middle","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":["Chinese University of Hong Kong, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005847882","display_name":"Reynold Cheng","orcid":"https://orcid.org/0000-0002-9480-9809"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]},{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Reynold Cheng","raw_affiliation_strings":["The University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061340195","display_name":"Laks V. S. Lakshmanan","orcid":"https://orcid.org/0000-0002-9775-4241"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Laks V. S. Lakshmanan","raw_affiliation_strings":["The University of British Columbia, Vancouver, Canada"],"affiliations":[{"raw_affiliation_string":"The University of British Columbia, Vancouver, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027073630","display_name":"Xiaolin Han","orcid":"https://orcid.org/0000-0001-9721-5371"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]},{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaolin Han","raw_affiliation_strings":["The University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5055857919"],"corresponding_institution_ids":["https://openalex.org/I177725633","https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":2.8095,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.92258794,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"845","last_page":"859"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9993000030517578,"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.9993000030517578,"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.9968000054359436,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.6896294355392456},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6756214499473572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6552750468254089},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6041286587715149},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5817303657531738},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.567061185836792},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49866533279418945},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4604339003562927},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4199777841567993},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.41840285062789917},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4003353714942932},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37515121698379517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36029452085494995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26422804594039917},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09406989812850952}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6896294355392456},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6756214499473572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6552750468254089},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6041286587715149},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5817303657531738},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.567061185836792},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49866533279418945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4604339003562927},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4199777841567993},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.41840285062789917},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4003353714942932},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37515121698379517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36029452085494995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26422804594039917},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09406989812850952},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3514221.3517837","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3514221.3517837","pdf_url":null,"source":{"id":"https://openalex.org/S4363608845","display_name":"Proceedings of the 2022 International Conference on Management of Data","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2615938319","display_name":null,"funder_award_id":"104005858,10400599,2100048","funder_id":"https://openalex.org/F4320322170","funder_display_name":"University of Hong Kong"}],"funders":[{"id":"https://openalex.org/F4320322170","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W183656749","https://openalex.org/W1535144194","https://openalex.org/W1560607100","https://openalex.org/W1802829841","https://openalex.org/W1924929788","https://openalex.org/W1964043357","https://openalex.org/W1977458171","https://openalex.org/W1978024959","https://openalex.org/W1983383464","https://openalex.org/W1994473607","https://openalex.org/W2010033398","https://openalex.org/W2020742901","https://openalex.org/W2030365814","https://openalex.org/W2041472519","https://openalex.org/W2046804949","https://openalex.org/W2051109346","https://openalex.org/W2054560566","https://openalex.org/W2062029454","https://openalex.org/W2103063352","https://openalex.org/W2112615110","https://openalex.org/W2138621811","https://openalex.org/W2259724869","https://openalex.org/W2266714125","https://openalex.org/W2348679751","https://openalex.org/W2605272442","https://openalex.org/W2767952030","https://openalex.org/W2913668833","https://openalex.org/W2953102514","https://openalex.org/W2970828623","https://openalex.org/W2982295803","https://openalex.org/W3022297969","https://openalex.org/W3030935614","https://openalex.org/W3032557024","https://openalex.org/W3035455649","https://openalex.org/W3141857288","https://openalex.org/W3175911760","https://openalex.org/W3212747350","https://openalex.org/W4200304743","https://openalex.org/W4283366068","https://openalex.org/W6608257180","https://openalex.org/W6649007876"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2167355524","https://openalex.org/W1034070228","https://openalex.org/W1995329927","https://openalex.org/W2077912839","https://openalex.org/W2537735054","https://openalex.org/W2031552172"],"abstract_inverted_index":{"Given":[0],"a":[1,14,34,80,89],"directed":[2,6],"graph":[3,56],"G,":[4,17],"the":[5,21,48,85,96,149],"densest":[7],"subgraph":[8,15],"(DDS)":[9],"problem":[10,30,50,87],"refers":[11],"to":[12,33,53,142],"finding":[13],"from":[16,70],"whose":[18],"density":[19],"is":[20,31],"highest":[22],"among":[23],"all":[24],"subgraphs":[25],"of":[26,37,91,98,125,145],"G.":[27],"The":[28,133],"DDS":[29,49,67,86],"fundamental":[32],"wide":[35],"range":[36],"applications,":[38],"such":[39,58],"as":[40,59],"fake":[41],"follower":[42],"detection":[43],"and":[44,62,72,105],"community":[45],"mining.":[46],"Theoretically,":[47],"closely":[51],"connects":[52],"other":[54],"essential":[55],"problems,":[57],"network":[60],"flow":[61],"bipartite":[63],"matching.":[64],"However,":[65],"existing":[66],"solutions":[68],"suffer":[69],"efficiency":[71],"scalability":[73],"issues.":[74],"In":[75],"this":[76],"paper,":[77],"we":[78,101],"develop":[79,102],"convex-programming-based":[81],"solution":[82],"by":[83],"transforming":[84],"into":[88],"set":[90],"linear":[92,99],"programs.":[93],"Based":[94],"on":[95,128],"duality":[97],"programs,":[100],"efficient":[103],"exact":[104],"approximation":[106,110,116],"algorithms.":[107],"Especially,":[108],"our":[109,126,137],"algorithm":[111],"can":[112],"support":[113],"flexible":[114],"parameterized":[115],"guarantees.":[117],"We":[118],"have":[119],"performed":[120],"an":[121],"extensive":[122],"empirical":[123],"evaluation":[124],"approaches":[127],"eight":[129],"real":[130],"large":[131],"datasets.":[132],"results":[134],"show":[135],"that":[136],"proposed":[138],"algorithms":[139],"are":[140],"up":[141],"five":[143],"orders":[144],"magnitude":[146],"faster":[147],"than":[148],"state-of-the-art.":[150]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}