{"id":"https://openalex.org/W2620706275","doi":"https://doi.org/10.1145/1824777.1824780","title":"A local algorithm for finding dense subgraphs","display_name":"A local algorithm for finding dense subgraphs","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2620706275","doi":"https://doi.org/10.1145/1824777.1824780","mag":"2620706275"},"language":"en","primary_location":{"id":"doi:10.1145/1824777.1824780","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1824777.1824780","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-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/A5007626895","display_name":"Reid Andersen","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Reid Andersen","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007626895"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":2.8502,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.90288426,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9962999820709229,"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/mathematics","display_name":"Mathematics","score":0.7367026209831238},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7000623941421509},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.670400083065033},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6352392435073853},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.5546627044677734},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.541670024394989},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5154129266738892},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.4872109293937683},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4228835105895996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40748512744903564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40701574087142944},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2697030007839203},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23385685682296753}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7367026209831238},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7000623941421509},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.670400083065033},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6352392435073853},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.5546627044677734},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.541670024394989},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5154129266738892},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.4872109293937683},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4228835105895996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40748512744903564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40701574087142944},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2697030007839203},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23385685682296753},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1824777.1824780","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1824777.1824780","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W183656749","https://openalex.org/W1500512125","https://openalex.org/W1511439182","https://openalex.org/W1535144194","https://openalex.org/W1604983895","https://openalex.org/W1888358353","https://openalex.org/W2010787744","https://openalex.org/W2013469283","https://openalex.org/W2017345786","https://openalex.org/W2036836182","https://openalex.org/W2045107949","https://openalex.org/W2057046770","https://openalex.org/W2086254934","https://openalex.org/W2106302753","https://openalex.org/W2135512436","https://openalex.org/W2151626491","https://openalex.org/W2153291291","https://openalex.org/W2952395520","https://openalex.org/W4249653116","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2364074136","https://openalex.org/W4320022211","https://openalex.org/W4313325064","https://openalex.org/W2071364952","https://openalex.org/W2789630860","https://openalex.org/W4224270192","https://openalex.org/W1985038305","https://openalex.org/W3084441407","https://openalex.org/W3020996517","https://openalex.org/W1988932361"],"abstract_inverted_index":{"We":[0,107,152],"describe":[1],"a":[2,13,28,33,39,70,125,136],"local":[3,53],"algorithm":[4,24,84,134],"for":[5,113,131],"finding":[6],"subgraphs":[7],"with":[8,117,138],"high":[9],"density,":[10],"according":[11],"to":[12],"measure":[14],"of":[15,48,72,82,104,161],"density":[16,121,139],"introduced":[17],"by":[18,87],"Kannan":[19],"and":[20,38,43,120,147],"Vinay":[21],"[1999].":[22],"The":[23,79],"takes":[25],"as":[26],"input":[27,64],"bipartite":[29],"graph":[30,74],"G":[31,49],",":[32,37,42],"starting":[34,77],"vertex":[35],"v":[36,143],"parameter":[40],"k":[41,90,148,150],"outputs":[44,135],"an":[45],"induced":[46],"subgraph":[47,115,137],".":[50,166],"It":[51],"is":[52,85,101],"in":[54,164],"the":[55,62,73,76,83,96,105,109,133,162],"sense":[56],"that":[57,154],"it":[58,67],"does":[59],"not":[60],"examine":[61],"entire":[63],"graph;":[65],"instead,":[66],"adaptively":[68],"explores":[69],"region":[71],"near":[75],"vertex.":[78],"running":[80],"time":[81],"bounded":[86],"O":[88],"(\u0394":[89],"2":[91],"),":[92],"which":[93,132],"depends":[94],"on":[95],"maximum":[97],"degree":[98],"\u0394,":[99],"but":[100],"otherwise":[102],"independent":[103],"graph.":[106],"prove":[108,153],"following":[110],"approximation":[111],"guarantee:":[112],"any":[114],"S":[116,127,130,145,155,165],"k\u2032":[118],"vertices":[119],"\u03b8,":[122],"there":[123],"exists":[124],"set":[126],"\u2032":[128,146,156],"\u2286":[129],"\u03a9(\u03b8/log":[140],"\u0394)":[141],"whenever":[142],"\u2208":[144],"\u2265":[149],"\u2032.":[151],"contains":[157],"at":[158],"least":[159],"half":[160],"edges":[163]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}