{"id":"https://openalex.org/W2266714125","doi":"https://doi.org/10.1145/2736277.2741098","title":"The K-clique Densest Subgraph Problem","display_name":"The K-clique Densest Subgraph Problem","publication_year":2015,"publication_date":"2015-05-18","ids":{"openalex":"https://openalex.org/W2266714125","doi":"https://doi.org/10.1145/2736277.2741098","mag":"2266714125"},"language":"en","primary_location":{"id":"doi:10.1145/2736277.2741098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2736277.2741098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Conference on World Wide Web","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/A5069421706","display_name":"Charalampos E. Tsourakakis","orcid":"https://orcid.org/0000-0001-5591-3585"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Charalampos Tsourakakis","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069421706"],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":20.3756,"has_fulltext":false,"cited_by_count":245,"citation_normalized_percentile":{"value":0.99595269,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1122","last_page":"1132"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/clique","display_name":"Clique","score":0.6733769178390503},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5957155823707581},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5948891639709473},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5210461020469666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5171391367912292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4605042636394501},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.4201204478740692},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.41149812936782837},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39341074228286743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36199578642845154}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6733769178390503},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5957155823707581},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5948891639709473},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5210461020469666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5171391367912292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4605042636394501},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.4201204478740692},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.41149812936782837},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39341074228286743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36199578642845154},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2736277.2741098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2736277.2741098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th International Conference on World Wide Web","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.695.7667","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.695.7667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.www2015.it/documents/proceedings/proceedings/p1122.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.725.7455","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.7455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.seas.harvard.edu/%7Ebabis/kcliqueDSP.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W183656749","https://openalex.org/W1498671329","https://openalex.org/W1500483810","https://openalex.org/W1500512125","https://openalex.org/W1535144194","https://openalex.org/W1542957328","https://openalex.org/W1604983895","https://openalex.org/W1676999057","https://openalex.org/W1849583273","https://openalex.org/W1888358353","https://openalex.org/W1889221628","https://openalex.org/W1964419312","https://openalex.org/W1967066104","https://openalex.org/W1968895412","https://openalex.org/W1974874717","https://openalex.org/W1977458171","https://openalex.org/W1978024959","https://openalex.org/W1991858502","https://openalex.org/W2002205566","https://openalex.org/W2004336221","https://openalex.org/W2005499394","https://openalex.org/W2013414394","https://openalex.org/W2013469283","https://openalex.org/W2030365814","https://openalex.org/W2031082424","https://openalex.org/W2032279394","https://openalex.org/W2035575256","https://openalex.org/W2036836182","https://openalex.org/W2038073775","https://openalex.org/W2043521128","https://openalex.org/W2050511894","https://openalex.org/W2051109346","https://openalex.org/W2051586153","https://openalex.org/W2054100908","https://openalex.org/W2056991815","https://openalex.org/W2062931369","https://openalex.org/W2081254453","https://openalex.org/W2100440346","https://openalex.org/W2110814195","https://openalex.org/W2113137767","https://openalex.org/W2115659887","https://openalex.org/W2119757574","https://openalex.org/W2121526866","https://openalex.org/W2128059732","https://openalex.org/W2136850043","https://openalex.org/W2173213060","https://openalex.org/W2259724869","https://openalex.org/W2266714125","https://openalex.org/W2401365453","https://openalex.org/W2952763838","https://openalex.org/W2953102514","https://openalex.org/W4214508572","https://openalex.org/W4230053343"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2604114816","https://openalex.org/W2954463587","https://openalex.org/W2393701947"],"abstract_inverted_index":{"Numerous":[0],"graph":[1],"mining":[2],"applications":[3],"rely":[4],"on":[5],"detecting":[6,67],"subgraphs":[7,48],"which":[8,40],"are":[9,15,21],"large":[10,19,54,68],"near-cliques.":[11],"Since":[12],"formulations":[13],"that":[14],"geared":[16],"towards":[17],"finding":[18],"near-cliques":[20,69],"hard":[22],"and":[23],"frequently":[24,60],"inapproximable":[25],"due":[26],"to":[27],"connections":[28],"with":[29],"the":[30,34,42,51,61],"Maximum":[31],"Clique":[32],"problem,":[33],"poly-time":[35],"solvable":[36],"densest":[37,62],"subgraph":[38,63],"problem":[39,64],"maximizes":[41],"average":[43],"degree":[44],"over":[45],"all":[46],"possible":[47],"\"lies":[49],"at":[50],"core":[52],"of":[53],"scale":[55],"data":[56],"mining\"":[57],"[10].":[58],"However,":[59],"fails":[65],"in":[66,70],"networks.":[71]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":31},{"year":2023,"cited_by_count":26},{"year":2022,"cited_by_count":37},{"year":2021,"cited_by_count":28},{"year":2020,"cited_by_count":29},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":7}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2025-10-10T00:00:00"}