{"id":"https://openalex.org/W4399174484","doi":"https://doi.org/10.1145/3654922","title":"A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery","display_name":"A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery","publication_year":2024,"publication_date":"2024-05-29","ids":{"openalex":"https://openalex.org/W4399174484","doi":"https://doi.org/10.1145/3654922"},"language":"en","primary_location":{"id":"doi:10.1145/3654922","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3654922","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3654922","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/3654922","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, 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":"middle","author":{"id":"https://openalex.org/A5056928607","display_name":"Qingshuo Guo","orcid":"https://orcid.org/0009-0000-4477-6052"},"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":"Qingshuo Guo","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0009-0000-4477-6052","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/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"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055857919","display_name":"Chenhao Ma","orcid":"https://orcid.org/0000-0002-3243-8512"},"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":"Chenhao Ma","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"],"raw_orcid":"https://orcid.org/0000-0002-3243-8512","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":2.2723,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.89038014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"2","issue":"3","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9991999864578247,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9976999759674072,"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/enumeration","display_name":"Enumeration","score":0.6955975294113159},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6892324686050415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5539794564247131},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.49303528666496277},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4480828642845154},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44516605138778687},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.41987258195877075},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4114789366722107},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4014192223548889},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3882761597633362},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38472408056259155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35053449869155884},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.18508529663085938},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07483020424842834}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6955975294113159},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6892324686050415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5539794564247131},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.49303528666496277},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4480828642845154},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44516605138778687},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.41987258195877075},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4114789366722107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4014192223548889},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3882761597633362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38472408056259155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35053449869155884},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.18508529663085938},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07483020424842834},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"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/3654922","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3654922","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3654922","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/3654922","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3654922","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3654922","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":[{"id":"https://openalex.org/G1392884172","display_name":null,"funder_award_id":"62302421","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7312369907","display_name":null,"funder_award_id":"62102341","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399174484.pdf","grobid_xml":"https://content.openalex.org/works/W4399174484.grobid-xml"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W168389790","https://openalex.org/W1502940150","https://openalex.org/W1506342804","https://openalex.org/W1535144194","https://openalex.org/W1555111922","https://openalex.org/W1888358353","https://openalex.org/W1924929788","https://openalex.org/W1964043357","https://openalex.org/W1968895412","https://openalex.org/W1972558815","https://openalex.org/W1974874717","https://openalex.org/W1977458171","https://openalex.org/W1994924587","https://openalex.org/W2020742901","https://openalex.org/W2043521128","https://openalex.org/W2047923585","https://openalex.org/W2054560566","https://openalex.org/W2115659887","https://openalex.org/W2119757574","https://openalex.org/W2121526866","https://openalex.org/W2153250079","https://openalex.org/W2160556205","https://openalex.org/W2217968126","https://openalex.org/W2259724869","https://openalex.org/W2266714125","https://openalex.org/W2553356062","https://openalex.org/W2605272442","https://openalex.org/W2787993231","https://openalex.org/W2890003917","https://openalex.org/W2953102514","https://openalex.org/W2970828623","https://openalex.org/W2997302914","https://openalex.org/W3012952222","https://openalex.org/W3022297969","https://openalex.org/W3032557024","https://openalex.org/W3035455649","https://openalex.org/W3046691040","https://openalex.org/W3087969247","https://openalex.org/W3094534277","https://openalex.org/W3102137745","https://openalex.org/W3102523054","https://openalex.org/W3103717999","https://openalex.org/W3105618966","https://openalex.org/W3169407702","https://openalex.org/W3210793653","https://openalex.org/W4210896998","https://openalex.org/W4281779720","https://openalex.org/W4281922064","https://openalex.org/W4290877309","https://openalex.org/W4312389781","https://openalex.org/W4313172799","https://openalex.org/W4379539435","https://openalex.org/W4380433246","https://openalex.org/W4381327380","https://openalex.org/W4385318193"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2361654510","https://openalex.org/W2036065890","https://openalex.org/W2575141006","https://openalex.org/W1983171305","https://openalex.org/W2142652836","https://openalex.org/W2376954560","https://openalex.org/W4362723844","https://openalex.org/W3083429938"],"abstract_inverted_index":{"Densest":[0],"subgraph":[1,47,54],"discovery":[2],"(DSD)":[3],"is":[4,73,86,112,155,209],"a":[5,26,39,53,56,120,134],"fundamental":[6],"topic":[7],"in":[8,16,25,82,89,129],"graph":[9],"mining.":[10],"It":[11],"has":[12,20,77],"been":[13],"extensively":[14],"studied":[15],"the":[17,44,60,63,68,83,109,127,139,152,160,165,175,197,200,218,222],"literature":[18],"and":[19,35,85,180,196],"found":[21],"many":[22],"real":[23],"applications":[24],"wide":[27],"range":[28],"of":[29,42,62,65,70,80,123,203,214],"fields,":[30],"such":[31,58],"as":[32],"biology,":[33],"finance,":[34],"social":[36],"networks.":[37],"As":[38],"typical":[40],"problem":[41,49,76],"DSD,":[43],"k-clique":[45,145,149,177],"densest":[46],"(CDS)":[48],"aims":[50],"to":[51,105,211],"detect":[52],"from":[55],"graph,":[57],"that":[59],"ratio":[61],"number":[64,69,122],"k-cliques":[66],"over":[67],"its":[71],"vertices":[72],"maximized.":[74],"This":[75],"received":[78],"plenty":[79],"attention":[81],"literature,":[84],"widely":[87],"used":[88],"identifying":[90],"larger":[91],"''near-cliques''.":[92],"Existing":[93],"CDS":[94],"solutions,":[95,102],"either":[96],"k-core":[97],"or":[98],"convex":[99],"programming":[100],"based":[101,137],"often":[103,156],"need":[104],"enumerate":[106],"almost":[107],"all":[108],"k-cliques,":[110],"which":[111,142],"very":[113],"inefficient":[114],"because":[115],"real-world":[116,193],"graphs":[117,195],"usually":[118],"have":[119,186],"vast":[121],"k-cliques.":[124],"To":[125],"improve":[126],"efficiency,":[128],"this":[130],"paper,":[131],"we":[132,167],"propose":[133],"novel":[135],"framework":[136],"on":[138,164,191],"Frank-Wolfe":[140],"algorithm,":[141,172],"only":[143],"needs":[144],"counting,":[146],"rather":[147],"than":[148,159,217],"enumeration,":[150],"where":[151],"former":[153],"one":[154],"much":[157],"faster":[158,216],"latter":[161],"one.":[162],"Based":[163],"framework,":[166],"develop":[168],"an":[169],"efficient":[170],"approximation":[171],"by":[173],"employing":[174],"state-of-the-art":[176,219],"counting":[178],"algorithm":[179,208,220],"proposing":[181],"some":[182],"optimization":[183],"techniques.":[184],"We":[185],"performed":[187],"extensive":[188],"experimental":[189],"evaluation":[190],"14":[192],"large":[194],"results":[198],"demonstrate":[199],"high":[201],"efficiency":[202],"our":[204,207],"algorithms.":[205],"Particularly,":[206],"up":[210],"seven":[212],"orders":[213],"magnitude":[215],"with":[221],"same":[223],"accuracy":[224],"guarantee.":[225]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}