{"id":"https://openalex.org/W2158662414","doi":"https://doi.org/10.1017/s0963548309990186","title":"Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections","display_name":"Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections","publication_year":2009,"publication_date":"2009-06-22","ids":{"openalex":"https://openalex.org/W2158662414","doi":"https://doi.org/10.1017/s0963548309990186","mag":"2158662414"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548309990186","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309990186","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5031648070","display_name":"David Gamarnik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"DAVID GAMARNIK","raw_affiliation_strings":["Operations Research Center and Sloan School of Management, MIT, Cambridge, MA 02139, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Center and Sloan School of Management, MIT, Cambridge, MA 02139, USA (e-mail:","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072646870","display_name":"David A. Goldberg","orcid":"https://orcid.org/0000-0002-5761-0286"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"DAVID A. GOLDBERG","raw_affiliation_strings":["Operations Research Center, MIT, Cambridge, MA 02139, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Center, MIT, Cambridge, MA 02139, USA (e-mail:","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4181,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.82667127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"1","first_page":"61","last_page":"85"},"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.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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.9980999827384949,"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/combinatorics","display_name":"Combinatorics","score":0.7874083518981934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7159044742584229},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7092380523681641},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.665531575679779},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.5931375622749329},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5923771858215332},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5304229855537415},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5175201892852783},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5132965445518494},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5001535415649414},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4853619337081909},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.4725838899612427},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45593494176864624},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4471924602985382},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.4346572160720825},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42315512895584106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3450910449028015},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.22541198134422302},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17400813102722168},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1272733211517334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12694117426872253},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.094098299741745}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7874083518981934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7159044742584229},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7092380523681641},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.665531575679779},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.5931375622749329},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5923771858215332},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5304229855537415},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5175201892852783},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5132965445518494},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5001535415649414},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4853619337081909},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.4725838899612427},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45593494176864624},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4471924602985382},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.4346572160720825},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42315512895584106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3450910449028015},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.22541198134422302},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17400813102722168},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1272733211517334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12694117426872253},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.094098299741745},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548309990186","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548309990186","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W22977650","https://openalex.org/W629161119","https://openalex.org/W1489847296","https://openalex.org/W1504317671","https://openalex.org/W1550301324","https://openalex.org/W1653539840","https://openalex.org/W1872905819","https://openalex.org/W1964543450","https://openalex.org/W1970411956","https://openalex.org/W1985770240","https://openalex.org/W1990326132","https://openalex.org/W1993433103","https://openalex.org/W2003665833","https://openalex.org/W2011648292","https://openalex.org/W2022432026","https://openalex.org/W2030087828","https://openalex.org/W2041605864","https://openalex.org/W2063175311","https://openalex.org/W2074920973","https://openalex.org/W2085155184","https://openalex.org/W2091166220","https://openalex.org/W2091476183","https://openalex.org/W2124088817","https://openalex.org/W2169071224","https://openalex.org/W2333561420","https://openalex.org/W2797135730","https://openalex.org/W2963332076","https://openalex.org/W2987732947","https://openalex.org/W3000591809"],"related_works":["https://openalex.org/W4321206936","https://openalex.org/W132569744","https://openalex.org/W4248742561","https://openalex.org/W1967643201","https://openalex.org/W2289857770","https://openalex.org/W1785083131","https://openalex.org/W2077728978","https://openalex.org/W1998882407","https://openalex.org/W2101075550","https://openalex.org/W1993489705"],"abstract_inverted_index":{"We":[0,23],"derive":[1],"new":[2],"results":[3,68,87,182,190],"for":[4,12,26,65,72,91,151,168,191],"the":[5,39,73,76,85,99,109,121,130,140,145,148,152,169,175,180,189,192],"performance":[6,146],"of":[7,45,75,88,123,147,154],"a":[8,54,103,164],"simple":[9,166],"greedy":[10,100,131,149],"algorithm":[11,40,101,132,150],"finding":[13],"large":[14],"independent":[15,43,78,124,158],"sets":[16,125,159],"and":[17,33,83,112,126,160,162],"matchings":[18,127],"in":[19,80,133],"constant-degree":[20],"regular":[21],"graphs.":[22],"show":[24,97,119],"that":[25,98,120],"r":[27,51,111],"-regular":[28],"graphs":[29,136],"with":[30],"n":[31],"nodes":[32],"girth":[34,113],"at":[35],"least":[36],"g":[37,114],",":[38],"finds":[41],"an":[42,94],"set":[44,79],"expected":[46,171],"cardinality":[47,122],"where":[48],"f":[49],"(":[50],")":[52],"is":[53,63,137],"function":[55],"which":[56],"we":[57,96,118,143],"explicitly":[58],"compute.":[59],"A":[60],"similar":[61],"result":[62],"established":[64],"matchings.":[66,92],"Our":[67],"imply":[69],"improved":[70],"bounds":[71],"size":[74],"largest":[77],"these":[81],"graphs,":[82],"provide":[84],"first":[86],"this":[89],"type":[90],"As":[93],"implication":[95],"returns":[102],"nearly":[104],"perfect":[105],"matching":[106],"when":[107],"both":[108],"degree":[110],"are":[115,183],"large.":[116],"Furthermore,":[117],"produced":[128,173],"by":[129,174],"arbitrary":[134],"bounded-degree":[135],"concentrated":[138],"around":[139],"mean.":[141],"Finally,":[142],"analyse":[144],"case":[153],"random":[155],"i.i.d.":[156],"weighted":[157,193],"matchings,":[161],"obtain":[163],"remarkably":[165],"expression":[167],"limiting":[170],"values":[172],"algorithm.":[176],"In":[177],"fact,":[178],"all":[179],"other":[181],"obtained":[184],"as":[185],"straightforward":[186],"corollaries":[187],"from":[188],"case.":[194]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}