{"id":"https://openalex.org/W7161571034","doi":"https://doi.org/10.1145/3802023","title":"Bound-Tightened Densest Subgraph Discovery on GPU","display_name":"Bound-Tightened Densest Subgraph Discovery on GPU","publication_year":2026,"publication_date":"2026-05-18","ids":{"openalex":"https://openalex.org/W7161571034","doi":"https://doi.org/10.1145/3802023"},"language":"en","primary_location":{"id":"doi:10.1145/3802023","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3802023","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://doi.org/10.1145/3802023","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071115023","display_name":"Wajid Manzoor","orcid":"https://orcid.org/0000-0001-6417-2520"},"institutions":[{"id":"https://openalex.org/I44265643","display_name":"Rowan University","ror":"https://ror.org/049v69k10","country_code":"US","type":"education","lineage":["https://openalex.org/I44265643"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wajid Manzoor","raw_affiliation_strings":["Rowan University, Glassboro, USA"],"raw_orcid":"https://orcid.org/0009-0001-7073-7257","affiliations":[{"raw_affiliation_string":"Rowan University, Glassboro, USA","institution_ids":["https://openalex.org/I44265643"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128354886","display_name":"Ke Fan","orcid":null},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ke Fan","raw_affiliation_strings":["Temple University, Philadelphia, USA"],"raw_orcid":"https://orcid.org/0000-0002-9563-6129","affiliations":[{"raw_affiliation_string":"Temple University, Philadelphia, USA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136453982","display_name":"Muhammad Shaheer","orcid":"https://orcid.org/0009-0000-7188-3603"},"institutions":[{"id":"https://openalex.org/I44265643","display_name":"Rowan University","ror":"https://ror.org/049v69k10","country_code":"US","type":"education","lineage":["https://openalex.org/I44265643"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Muhammad Shaheer","raw_affiliation_strings":["Rowan University, Glassboro, USA"],"raw_orcid":"https://orcid.org/0009-0000-7188-3603","affiliations":[{"raw_affiliation_string":"Rowan University, Glassboro, USA","institution_ids":["https://openalex.org/I44265643"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101909744","display_name":"Guimu Guo","orcid":"https://orcid.org/0000-0002-3573-7446"},"institutions":[{"id":"https://openalex.org/I44265643","display_name":"Rowan University","ror":"https://ror.org/049v69k10","country_code":"US","type":"education","lineage":["https://openalex.org/I44265643"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guimu Guo","raw_affiliation_strings":["Rowan University, Glassboro, USA"],"raw_orcid":"https://orcid.org/0000-0002-3573-7446","affiliations":[{"raw_affiliation_string":"Rowan University, Glassboro, USA","institution_ids":["https://openalex.org/I44265643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.6112979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"3","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6995000243186951,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6995000243186951,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.08320000022649765,"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.07199999690055847,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6556000113487244},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6269999742507935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5428000092506409},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.5324000120162964},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.47769999504089355},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46470001339912415},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.4221999943256378},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3896999955177307},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.34610000252723694}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6556000113487244},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6269999742507935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5446000099182129},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5428000092506409},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.5324000120162964},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.47769999504089355},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46470001339912415},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4147999882698059},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3896999955177307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.382099986076355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36719998717308044},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.34610000252723694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3334999978542328},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.27730000019073486},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.274399995803833},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.2728999853134155},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.26589998602867126},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3802023","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3802023","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/3802023","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3802023","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":[{"id":"https://openalex.org/G5242717640","display_name":"CRII: SHF: A Parallel and Distributed Framework for Graph Mining on GPUs","funder_award_id":"2245792","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1873547760","https://openalex.org/W1987634495","https://openalex.org/W2043349540","https://openalex.org/W2073973505","https://openalex.org/W2090359754","https://openalex.org/W2116007667","https://openalex.org/W2116094274","https://openalex.org/W2119799268","https://openalex.org/W2139599797","https://openalex.org/W2149342630","https://openalex.org/W2278186031","https://openalex.org/W2970828623","https://openalex.org/W4242981398","https://openalex.org/W4393085118","https://openalex.org/W4408061188"],"related_works":[],"abstract_inverted_index":{"The":[0,129],"densest":[1],"subgraph":[2,52],"discovery":[3,83],"(DSD)":[4],"problem":[5,146],"is":[6,41,132],"a":[7,25,44,90,95,143,151,172],"fundamental":[8],"task":[9],"in":[10,15],"graph":[11,19,26,124],"mining":[12],"with":[13,102,158],"applications":[14],"social":[16],"networks,":[17],"bioinformatics,":[18],"databases,":[20],"and":[21,33,105,147,161,165,177],"systems":[22],"engineering.":[23],"Given":[24],"G":[27,53],"=":[28],"(":[29,54],"V,":[30],"E":[31],")":[32,56],"an":[34],"integer":[35],"k":[36,59,67,74,97],"?":[37,48],"2,":[38],"the":[39,58,64,82,111,122,184],"goal":[40],"to":[42,109,120],"find":[43],"vertex":[45],"subset":[46],"D":[47,55],"V":[49],"whose":[50],"induced":[51],"maximizes":[57],"-clique":[60,98],"density,":[61],"defined":[62],"as":[63,142],"number":[65],"of":[66,73,84,175],"-cliques":[68],"per":[69],"vertex.":[70],"Larger":[71],"values":[72],"capture":[75],"higher-order":[76],"connectivity":[77],"patterns":[78],"beyond":[79],"edges,":[80],"enabling":[81],"more":[85],"cohesive":[86],"structures.":[87,169],"We":[88],"present":[89],"GPU-accelerated":[91],"framework":[92],"that":[93],"integrates":[94],"warp-level":[96],"enumeration":[99],"algorithm":[100],"along":[101],"clique-core\u2013based":[103],"pruning":[104,107],"edge":[106],"techniques":[108],"reduce":[110],"search":[112],"space,":[113],"followed":[114],"by":[115,135],"parallel":[116,153],"connected":[117,140],"component":[118,141],"decomposition":[119],"split":[121],"pruned":[123],"into":[125],"independent":[126],"smaller":[127],"subproblems.":[128],"exact":[130],"solution":[131],"then":[133],"obtained":[134],"formulating":[136],"DSD":[137],"on":[138,171],"each":[139],"maximum":[144],"flow":[145],"solving":[148],"it":[149],"using":[150],"highly":[152],"vertex-centric":[154],"push\u2013relabel":[155],"algorithm,":[156],"enhanced":[157],"tight":[159],"upper":[160],"lower":[162],"density":[163],"bounds":[164],"compact,":[166],"GPU-friendly":[167],"data":[168],"Experiments":[170],"diverse":[173],"set":[174],"real-world":[176],"synthetic":[178],"graphs":[179],"show":[180],"substantial":[181],"speedups":[182],"over":[183],"state-of-the-art":[185],"CPU":[186],"implementation,":[187],"while":[188],"producing":[189],"identical":[190],"solutions.":[191]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-05-19T00:00:00"}