{"id":"https://openalex.org/W2157261787","doi":"https://doi.org/10.1142/s0129626498000407","title":"A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph","display_name":"A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph","publication_year":1998,"publication_date":"1998-09-01","ids":{"openalex":"https://openalex.org/W2157261787","doi":"https://doi.org/10.1142/s0129626498000407","mag":"2157261787"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626498000407","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626498000407","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5063171222","display_name":"Evripidis Bampis","orcid":"https://orcid.org/0000-0002-4498-3040"},"institutions":[{"id":"https://openalex.org/I88467170","display_name":"Universit\u00e9 d'\u00c9vry Val-d'Essonne","ror":"https://ror.org/00e96v939","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"E. Bampis","raw_affiliation_strings":["LaMI, Universit\u00e9 d'Evry, Boulevard des Coquibus, 91025 Evry Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaMI, Universit\u00e9 d'Evry, Boulevard des Coquibus, 91025 Evry Cedex, France","institution_ids":["https://openalex.org/I88467170"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003864326","display_name":"Aristotelis Giannakos","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I88467170","display_name":"Universit\u00e9 d'\u00c9vry Val-d'Essonne","ror":"https://ror.org/00e96v939","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Giannakos","raw_affiliation_strings":["LRI, B\u00e2t 490, Universit\u00e9 de Paris Sud, 91405 Orsay Cedex, France","LaMI, Universit\u00e9 d'Evry, Boulevard des Coquibus, 91025 Evry Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, B\u00e2t 490, Universit\u00e9 de Paris Sud, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"LaMI, Universit\u00e9 d'Evry, Boulevard des Coquibus, 91025 Evry Cedex, France","institution_ids":["https://openalex.org/I88467170"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112084360","display_name":"A. V. Karzanov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115688","display_name":"Institute for Systems Analysis","ror":"https://ror.org/02kmet255","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210115688"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. Karzanov","raw_affiliation_strings":["Institute for System Analysis, 9, Prosp. Let Octyabrya, 117312 Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for System Analysis, 9, Prosp. Let Octyabrya, 117312 Moscow, Russia","institution_ids":["https://openalex.org/I4210115688"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111739071","display_name":"Yannis Manoussakis","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Y. Manoussakis","raw_affiliation_strings":["LRI, B\u00e2t 490, Universit\u00e9 de Paris Sud, 91405 Orsay Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, B\u00e2t 490, Universit\u00e9 de Paris Sud, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011937346","display_name":"Ioannis Milis","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"I. Milis","raw_affiliation_strings":["LRI, B\u00e2t 490, Universit\u00e9 de Paris Sud, 91405 Orsay Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI, B\u00e2t 490, Universit\u00e9 de Paris Sud, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24643298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"08","issue":"03","first_page":"399","last_page":"405"},"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.9995999932289124,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9990000128746033,"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/combinatorics","display_name":"Combinatorics","score":0.6485419869422913},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5430911779403687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5379102826118469},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4900771379470825},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48263484239578247},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.469188928604126},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4643761217594147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41741296648979187},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4162992537021637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41013896465301514},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3475068509578705}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6485419869422913},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5430911779403687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5379102826118469},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4900771379470825},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48263484239578247},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.469188928604126},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4643761217594147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41741296648979187},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4162992537021637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41013896465301514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3475068509578705},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626498000407","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626498000407","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2089439745","https://openalex.org/W2023670982","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W2236098968","https://openalex.org/W1577155814","https://openalex.org/W1838063489","https://openalex.org/W2099271296","https://openalex.org/W2743938404","https://openalex.org/W2084593768"],"abstract_inverted_index":{"We":[0],"present":[1],"au":[2],"intuitive":[3],"and":[4,45],"simple":[5],"O(":[6],"log":[7,10],"2":[8,14],"n":[9,29],"\u03a6)":[11],"time,":[12],"O(n":[13],"M(n))":[15],"processor":[16],"parallel":[17],"algorithm":[18,59,67],"for":[19],"finding":[20],"a":[21,25,62],"perfect":[22,40,77],"matching":[23],"in":[24,82],"planar":[26],"graph,":[27],"where":[28],"is":[30,34,47,79],"the":[31,35,38,43,48,70,74,83,86],"order,":[32],"\u03a6":[33],"number":[36,75],"of":[37,42,52,55,76,85],"distinct":[39],"matchings":[41,78],"graph":[44],"M(n)":[46],"best":[49],"sequential":[50],"complexity":[51],"matrix":[53],"multiplication":[54],"size":[56,84],"n.":[57],"The":[58],"runs":[60],"on":[61],"CRCW":[63],"PRAM.":[64],"Clearly,":[65],"our":[66],"belongs":[68],"to":[69],"class":[71],"NC":[72],"if":[73],"polynomially":[80],"bounded":[81],"input":[87],"graph.":[88]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}