{"id":"https://openalex.org/W2758725311","doi":"https://doi.org/10.1109/focs.2018.00068","title":"Planar Graph Perfect Matching Is in NC","display_name":"Planar Graph Perfect Matching Is in NC","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2758725311","doi":"https://doi.org/10.1109/focs.2018.00068","mag":"2758725311"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2018.00068","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2018.00068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1709.07822","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040375566","display_name":"Nima Anari","orcid":"https://orcid.org/0000-0002-4394-3530"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nima Anari","raw_affiliation_strings":["Stanford University, Stanford, California","#N#               Stanford University, Stanford, California#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, California","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"#N#               Stanford University, Stanford, California#N#","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007368382","display_name":"Vijay V. Vazirani","orcid":"https://orcid.org/0000-0002-4106-9077"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijay V. Vazirani","raw_affiliation_strings":["University of California, Irvine, California","\u00b6University of California, Irvine, California;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, California","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"\u00b6University of California, Irvine, California;","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.429,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62688527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"67","issue":"4","first_page":"1","last_page":"34"},"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.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/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7218624949455261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.714571475982666},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6363804340362549},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.600773811340332},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5229159593582153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5082144737243652},{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.4966772198677063},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4353247284889221},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3717772364616394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3653321862220764},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34993118047714233}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7218624949455261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.714571475982666},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6363804340362549},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.600773811340332},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5229159593582153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5082144737243652},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.4966772198677063},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4353247284889221},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3717772364616394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3653321862220764},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34993118047714233},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/focs.2018.00068","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2018.00068","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},{"id":"doi:10.1145/3397504","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3397504","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1709.07822","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.07822","pdf_url":"https://arxiv.org/pdf/1709.07822","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2758725311","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1709.07822.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1709.07822","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1709.07822","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1709.07822","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1709.07822","pdf_url":"https://arxiv.org/pdf/1709.07822","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4252799795","display_name":"RCN: DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization","funder_award_id":"1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6482526725","display_name":"ICES:  Large: Collaborative Research:  Markets, Algorithms, Applications and the Digital Economy","funder_award_id":"1216019","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8196236912","display_name":null,"funder_award_id":"CCF-1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2758725311.pdf","grobid_xml":"https://content.openalex.org/works/W2758725311.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W1540982129","https://openalex.org/W1952454332","https://openalex.org/W1980364701","https://openalex.org/W1981234161","https://openalex.org/W1985953373","https://openalex.org/W1994788283","https://openalex.org/W1995040285","https://openalex.org/W2006912660","https://openalex.org/W2022124805","https://openalex.org/W2032846330","https://openalex.org/W2056352038","https://openalex.org/W2069630142","https://openalex.org/W2079828065","https://openalex.org/W2100061495","https://openalex.org/W2113097540","https://openalex.org/W2123805664","https://openalex.org/W2127932013","https://openalex.org/W2131399793","https://openalex.org/W2140664980","https://openalex.org/W2327315803","https://openalex.org/W2399980850","https://openalex.org/W2405342941","https://openalex.org/W2606089246","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W2625490399","https://openalex.org/W2742794645","https://openalex.org/W2950616565","https://openalex.org/W3111890340","https://openalex.org/W3166103872","https://openalex.org/W4233756358","https://openalex.org/W4234163381","https://openalex.org/W4242029970","https://openalex.org/W6732393951","https://openalex.org/W6750215192"],"related_works":["https://openalex.org/W2962678445","https://openalex.org/W3003639791","https://openalex.org/W2181760199","https://openalex.org/W2597100404","https://openalex.org/W2917054893","https://openalex.org/W1536296221","https://openalex.org/W2497890598","https://openalex.org/W2618794602","https://openalex.org/W2766788849","https://openalex.org/W2948325253","https://openalex.org/W2002234069","https://openalex.org/W2963891649","https://openalex.org/W2346400836","https://openalex.org/W1631817230","https://openalex.org/W2896791044","https://openalex.org/W2962961997","https://openalex.org/W2900273937","https://openalex.org/W2915248511","https://openalex.org/W2788605809","https://openalex.org/W1626677565"],"abstract_inverted_index":{"Is":[0],"perfect":[1,37,60,112,126,146],"matching":[2,38,113,147],"in":[3,23,76,92,114,128,177,181],"NC?":[4],"That":[5],"is,":[6],"is":[7,62,70,75,136],"there":[8],"a":[9,99,111,115,129,142,151,179,193],"deterministic":[10],"fast":[11],"parallel":[12],"algorithm":[13,108,119,139],"for":[14,27,82,109,140],"it?":[15],"This":[16],"has":[17,48,86,97],"been":[18,88],"an":[19,50,106,137],"outstanding":[20],"open":[21],"question":[22],"theoretical":[24],"computer":[25],"science":[26],"over":[28],"three":[29],"decades,":[30],"ever":[31],"since":[32],"the":[33,43,53,57,73,80,121,145,163,182,185],"discovery":[34],"of":[35,45,59,144,158,162,184,188],"RNC":[36],"algorithms.":[39],"Within":[40],"this":[41,102,189],"question,":[42],"case":[44],"planar":[46,83,116],"graphs":[47],"remained":[49],"enigma:":[51],"On":[52],"one":[54,67,96],"hand,":[55],"counting":[56,85,125],"number":[58],"matchings":[61,127],"far":[63],"harder":[64],"than":[65],"finding":[66,95,110,141,192],"(the":[68],"former":[69],"#P-complete":[71],"and":[72,78,191],"latter":[74],"P),":[77],"on":[79],"other,":[81],"graphs,":[84],"long":[87],"known":[89],"to":[90],"be":[91,155],"NC":[93,107,138],"whereas":[94],"resisted":[98],"solution.":[100],"In":[101],"article,":[103],"we":[104],"give":[105],"graph.":[117],"Our":[118,132],"uses":[120],"above-stated":[122],"fact":[123],"about":[124],"crucial":[130],"way.":[131],"main":[133],"new":[134],"idea":[135],"face":[143,187],"polytope":[148,190],"at":[149],"which":[150],"set":[152],"(which":[153],"could":[154],"polynomially":[156],"large)":[157],"conditions,":[159],"involving":[160],"constraints":[161],"polytope,":[164],"are":[165,171],"simultaneously":[166],"satisfied.":[167],"Several":[168],"other":[169],"ideas":[170],"also":[172],"needed,":[173],"such":[174],"as":[175],"finding,":[176],"NC,":[178],"point":[180],"interior":[183],"minimum-weight":[186],"balanced":[194],"tight":[195],"odd":[196],"set.":[197]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-13T07:54:00.901334","created_date":"2025-10-10T00:00:00"}