{"id":"https://openalex.org/W1964011448","doi":"https://doi.org/10.1016/0022-0000(92)90005-4","title":"Perfect matching for regular graphs is AC0-hard for the general matching problem","display_name":"Perfect matching for regular graphs is AC0-hard for the general matching problem","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W1964011448","doi":"https://doi.org/10.1016/0022-0000(92)90005-4","mag":"1964011448"},"language":"en","primary_location":{"id":"doi:10.1016/0022-0000(92)90005-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0022-0000(92)90005-4","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","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/A5065666747","display_name":"Elias Dahlhaus","orcid":"https://orcid.org/0000-0001-8094-4383"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Elias Dahlhaus","raw_affiliation_strings":["Department of Computer Science, University of Bonn, R\u00f6merstrasse 164, Bonn D-5300, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, R\u00f6merstrasse 164, Bonn D-5300, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["Department of Computer Science, University of Bonn, R\u00f6merstrasse 164, Bonn D-5300, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, R\u00f6merstrasse 164, Bonn D-5300, Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065666747"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":2520,"currency":"USD","value_usd":2520},"apc_paid":null,"fwci":1.439,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.79660405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"44","issue":"1","first_page":"94","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9973000288009644,"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.7622873783111572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6884230375289917},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6185821890830994},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5525842905044556},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.5173460841178894},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4912955164909363},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4369821846485138},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.41566187143325806},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.29945260286331177},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21037650108337402},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19615498185157776}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7622873783111572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6884230375289917},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6185821890830994},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5525842905044556},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.5173460841178894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4912955164909363},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4369821846485138},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.41566187143325806},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.29945260286331177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21037650108337402},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19615498185157776},{"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.1016/0022-0000(92)90005-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0022-0000(92)90005-4","pdf_url":null,"source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer and System Sciences","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":23,"referenced_works":["https://openalex.org/W1512709563","https://openalex.org/W1537547867","https://openalex.org/W1808600260","https://openalex.org/W1975146994","https://openalex.org/W1980364701","https://openalex.org/W1981234161","https://openalex.org/W2017205387","https://openalex.org/W2048172960","https://openalex.org/W2065251841","https://openalex.org/W2071114738","https://openalex.org/W2071134069","https://openalex.org/W2089828587","https://openalex.org/W2343730655","https://openalex.org/W2528648156","https://openalex.org/W6630635006","https://openalex.org/W6632148592","https://openalex.org/W6643870468","https://openalex.org/W6645489038","https://openalex.org/W6656615758","https://openalex.org/W6667196896","https://openalex.org/W6668258821","https://openalex.org/W6704223737","https://openalex.org/W6822831480"],"related_works":["https://openalex.org/W4287117052","https://openalex.org/W1586239617","https://openalex.org/W2145610052","https://openalex.org/W3215430368","https://openalex.org/W2132199417","https://openalex.org/W4389478392","https://openalex.org/W2083238533","https://openalex.org/W2007560929","https://openalex.org/W2152515622","https://openalex.org/W2044089009"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}