{"id":"https://openalex.org/W2889287172","doi":"https://doi.org/10.1145/3230819","title":"Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond","display_name":"Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond","publication_year":2018,"publication_date":"2018-08-28","ids":{"openalex":"https://openalex.org/W2889287172","doi":"https://doi.org/10.1145/3230819","mag":"2889287172"},"language":"en","primary_location":{"id":"doi:10.1145/3230819","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3230819","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/A5047480720","display_name":"Hossein Esfandiari","orcid":"https://orcid.org/0000-0001-8130-6631"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hossein Esfandiari","raw_affiliation_strings":["Computer Science School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammadtaghi Hajiaghayi","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055811592","display_name":"Vahid Liaghat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vahid Liaghat","raw_affiliation_strings":["Institute for Computational and Mathematical Engineering, Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computational and Mathematical Engineering, Stanford University","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055267502","display_name":"Morteza Monemizadeh","orcid":"https://orcid.org/0000-0002-8459-7822"},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Morteza Monemizadeh","raw_affiliation_strings":["Amazon, Palo Alto, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Amazon, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1311688040"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040763434","display_name":"Krzysztof Onak","orcid":"https://orcid.org/0000-0003-0226-7449"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krzysztof Onak","raw_affiliation_strings":["IBM TJ Watson Research Center, Yorktown Heights, New York, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM TJ Watson Research Center, Yorktown Heights, New York, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4641,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.90062638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":"4","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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.9943000078201294,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/arboricity","display_name":"Arboricity","score":0.8630037307739258},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6849954128265381},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6695288419723511},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6130829453468323},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.6064984798431396},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.6017263531684875},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5907467007637024},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5833776593208313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4653991162776947},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.42550569772720337},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4253145456314087},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.420682817697525},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3552249073982239},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3338651657104492},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32222121953964233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2497783899307251},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24881824851036072},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08871743083000183}],"concepts":[{"id":"https://openalex.org/C83204008","wikidata":"https://www.wikidata.org/wiki/Q4784907","display_name":"Arboricity","level":4,"score":0.8630037307739258},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6849954128265381},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6695288419723511},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6130829453468323},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.6064984798431396},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.6017263531684875},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5907467007637024},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5833776593208313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4653991162776947},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.42550569772720337},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4253145456314087},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.420682817697525},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3552249073982239},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3338651657104492},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32222121953964233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2497783899307251},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24881824851036072},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08871743083000183},{"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/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/3230819","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3230819","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":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W199203743","https://openalex.org/W1484040084","https://openalex.org/W1498807656","https://openalex.org/W1514707655","https://openalex.org/W1539682630","https://openalex.org/W1564876084","https://openalex.org/W1582032289","https://openalex.org/W1592953077","https://openalex.org/W1595640791","https://openalex.org/W1639030016","https://openalex.org/W1871809785","https://openalex.org/W1965765215","https://openalex.org/W1980155175","https://openalex.org/W1983248819","https://openalex.org/W2003425214","https://openalex.org/W2003813631","https://openalex.org/W2047993669","https://openalex.org/W2062881383","https://openalex.org/W2083432171","https://openalex.org/W2096413587","https://openalex.org/W2109330224","https://openalex.org/W2116953739","https://openalex.org/W2133476289","https://openalex.org/W2146343385","https://openalex.org/W2148137544","https://openalex.org/W2153822379","https://openalex.org/W2157523155","https://openalex.org/W2162656786","https://openalex.org/W2165753192","https://openalex.org/W2295466155","https://openalex.org/W2627491027","https://openalex.org/W2762990162","https://openalex.org/W2788362138","https://openalex.org/W2998414467","https://openalex.org/W3021537373","https://openalex.org/W4252630569"],"related_works":["https://openalex.org/W2962805102","https://openalex.org/W2997789361","https://openalex.org/W2950790198","https://openalex.org/W4300971928","https://openalex.org/W4239886656","https://openalex.org/W2139849594","https://openalex.org/W2889287172","https://openalex.org/W2272441262","https://openalex.org/W1499514251","https://openalex.org/W2004916648"],"abstract_inverted_index":{"We":[0,120,144],"consider":[1],"the":[2,6,13,22,40,59,67,84,91,96,103,110,122,126,147,161,173,182,189,201,217,220,242],"problem":[3],"of":[4,8,42,61,69,86,98,134,219,239,257,265,277,279],"estimating":[5,95],"size":[7,41,97,150,218],"a":[9,18,29,43,47,99,165,198,225],"maximum":[10,44,100,221],"matching":[11,45,101,222],"when":[12,160,168,181],"edges":[14,183],"are":[15,275],"revealed":[16],"in":[17,102,114,125,185,259],"streaming":[19,33,105,112,213],"fashion.":[20],"When":[21],"input":[23,162,174,190],"graph":[24,163,175,191],"is":[25,58,90,164,210,249],"planar,":[26],"we":[27,169,196,245],"present":[28],"simple":[30],"and":[31,137,172,179,188,230],"elegant":[32],"algorithm":[34,214,252],"that,":[35],"with":[36,78,141],"high":[37],"probability,":[38],"estimates":[39,216],"within":[46,224],"constant":[48,280],"factor":[49,226],"using":[50],"\u00d5(":[51],"n":[52,57,117,153,235,262],"2/3":[53],")":[54,118,154,237,263],"space,":[55],"where":[56],"number":[60],"vertices.":[62],"The":[63,267],"approach":[64],"generalizes":[65],"to":[66,109,151,206,223],"family":[68],"graphs":[70,77,140,273],"that":[71,208,215,247,253,274],"have":[72,170],"bounded":[73,142,177,193],"arboricity,":[74],"which":[75],"include":[76],"an":[79],"excluded":[80],"constant-size":[81],"minor.":[82],"To":[83],"best":[85],"our":[87],"knowledge,":[88],"this":[89,255],"first":[92],"result":[93],"for":[94,155,272],"adversarial-order":[104,127],"model":[106,128],"(as":[107],"opposed":[108],"random-order":[111],"model)":[113],"o":[115,233,260],"(":[116,234,261],"space.":[119,240,266],"circumvent":[121],"barriers":[123],"inherent":[124],"by":[129],"exploiting":[130],"several":[131],"structural":[132],"properties":[133],"planar":[135],"graphs,":[136],"more":[138],"generally,":[139],"arboricity.":[143,194],"further":[145],"reduce":[146],"required":[148],"memory":[149],"\u00d5(\u221a":[152],"three":[156],"restricted":[157],"settings:":[158],"(i)":[159],"forest;":[166],"(ii)":[167],"2-passes":[171],"has":[176,192],"arboricity;":[178],"(iii)":[180],"arrive":[184],"random":[186],"order":[187],"Finally,":[195],"design":[197],"reduction":[199],"from":[200],"Boolean":[202],"Hidden":[203],"Matching":[204],"Problem":[205],"show":[207,246],"there":[209,248],"no":[211,250],"randomized":[212],"better":[227],"than":[228],"3/2":[229],"uses":[231],"only":[232],"1/2":[236],"bits":[238,264],"Using":[241],"same":[243],"reduction,":[244],"deterministic":[251],"computes":[254],"kind":[256],"estimate":[258],"lower":[268],"bounds":[269],"hold":[270],"even":[271],"collections":[276],"paths":[278],"length.":[281]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2018-09-07T00:00:00"}