{"id":"https://openalex.org/W2010787744","doi":null,"title":"On the densest k-subgraph problems","display_name":"On the densest k-subgraph problems","alternate_titles":[],"publication_year":1997,"publication_date":"1997-09-01","ids":{"openalex":"https://openalex.org/W2010787744","mag":"2010787744"},"language":"en","primary_location":{"id":"mag:2010787744","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=903587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2010787744"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392","observed_orcids":["https://orcid.org/0009-0006-3749-4392"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Uriel Feige","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068153560","display_name":"M. Seltser","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"M. Seltser","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0997,"has_fulltext":false,"cited_by_count":141,"citation_normalized_percentile":{"value":0.85100775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9789999723434448,"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.9789999723434448,"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.014600000344216824,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.0020000000949949026,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9200000166893005},{"id":"https://openalex.org/keywords/maximum-degree-three","display_name":"maximum degree three","score":0.7229999899864197},{"id":"https://openalex.org/keywords/k-clique","display_name":"k-clique","score":0.6859999895095825},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"semidefinite programming","score":0.8309999704360962},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6959999799728394},{"id":"https://openalex.org/keywords/average-degree","display_name":"average degree","score":0.6420000195503235},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.5529999732971191}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8598000407218933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.689681887626648},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6339946985244751},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6035350561141968},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5821655988693237},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5700477957725525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5052488446235657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3855081796646118},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14527586102485657},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05879843235015869},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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":"mag:2010787744","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=903587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7099519679","https://openalex.org/W1596683029","https://openalex.org/W7097116829","https://openalex.org/W2036836182","https://openalex.org/W2950602321","https://openalex.org/W2951914620","https://openalex.org/W2115659887","https://openalex.org/W7019170822","https://openalex.org/W3046691040","https://openalex.org/W1664024785"],"abstract_inverted_index":{"Given":[0],"an":[1,49],"n-vertex":[2],"graph":[3],"G":[4,39,43],"and":[5,95],"a":[6,13,45],"parameter":[7],"k,":[8],"we":[9,47],"are":[10],"to":[11,88],"find":[12],"k-vertex":[14,101],"subgraph":[15,102],"with":[16],"the":[17,29,35,60,67,99],"maximum":[18,36],"number":[19],"of":[20,62],"edges.":[21],"This":[22],"problem":[23,30],"is":[24,40,77],"NP-hard.":[25],"We":[26,58],"show":[27],"that":[28,51,80,92],"remains":[31],"NP-hard":[32],"even":[33],"when":[34],"degree":[37,105],"in":[38,74,97],"three.":[41],"When":[42],"contains":[44],"k-clique,":[46],"give":[48],"algorithm":[50],"for":[52,65,81],"any":[53],"e":[54],"sub":[56],"/sub<)/e).":[57],"study":[59],"applicability":[61],"semidefinite":[63,85],"programming":[64],"approximating":[66],"dense":[68],"k-subgraph":[69],"problem.":[70],"Our":[71],"main":[72],"result":[73],"this":[75],"respect":[76],"negative,":[78],"showing":[79],"k":[82],"@":[83],"n1/3,":[84],"programs":[86],"fail":[87],"distinguish":[89],"between":[90],"graphs":[91,96],"contain":[93],"k-cliques":[94],"which":[98],"densest":[100],"has":[103],"average":[104],"below":[106],"logn.":[107]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2010787744","counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
