{"id":"https://openalex.org/W2075963188","doi":"https://doi.org/10.1016/0304-3975(88)90120-x","title":"Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs","display_name":"Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs","publication_year":1988,"publication_date":"1988-11-01","ids":{"openalex":"https://openalex.org/W2075963188","doi":"https://doi.org/10.1016/0304-3975(88)90120-x","mag":"2075963188"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(88)90120-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90120-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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":false,"raw_author_name":"Elias Dahlhaus","raw_affiliation_strings":["Department of Computer Science, University of Bonn, 5300 Bonn 1, Fed. Rep. Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, 5300 Bonn 1, Fed. Rep. 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, 5300 Bonn 1, Fed. Rep. Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bonn, 5300 Bonn 1, Fed. Rep. Germany","institution_ids":["https://openalex.org/I135140700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0715,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76376635,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"61","issue":"2-3","first_page":"121","last_page":"136"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.6480340361595154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5069842338562012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4880744218826294},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.4806853234767914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44294050335884094},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3795643448829651},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34067922830581665},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3286682963371277},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3206353783607483},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.15391415357589722}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6480340361595154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5069842338562012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4880744218826294},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.4806853234767914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44294050335884094},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3795643448829651},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34067922830581665},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3286682963371277},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3206353783607483},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.15391415357589722}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(88)90120-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90120-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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":43,"referenced_works":["https://openalex.org/W1537547867","https://openalex.org/W1574303240","https://openalex.org/W1808600260","https://openalex.org/W1964011448","https://openalex.org/W1965022641","https://openalex.org/W1968069760","https://openalex.org/W1971367602","https://openalex.org/W1975146994","https://openalex.org/W1980364701","https://openalex.org/W1981234161","https://openalex.org/W1996876354","https://openalex.org/W2004350101","https://openalex.org/W2011039300","https://openalex.org/W2016602956","https://openalex.org/W2017205387","https://openalex.org/W2026143151","https://openalex.org/W2040371705","https://openalex.org/W2048236984","https://openalex.org/W2049337025","https://openalex.org/W2065251841","https://openalex.org/W2066708286","https://openalex.org/W2071114738","https://openalex.org/W2071134069","https://openalex.org/W2089828587","https://openalex.org/W2153746396","https://openalex.org/W2314240464","https://openalex.org/W2343730655","https://openalex.org/W2531721207","https://openalex.org/W2610479830","https://openalex.org/W4300118906","https://openalex.org/W6632148592","https://openalex.org/W6643870468","https://openalex.org/W6645489038","https://openalex.org/W6654476180","https://openalex.org/W6656615758","https://openalex.org/W6660529751","https://openalex.org/W6662626567","https://openalex.org/W6667196896","https://openalex.org/W6667408575","https://openalex.org/W6668258821","https://openalex.org/W6676739934","https://openalex.org/W6704223737","https://openalex.org/W6728518899"],"related_works":["https://openalex.org/W1586239617","https://openalex.org/W1933485572","https://openalex.org/W4299564171","https://openalex.org/W2052621607","https://openalex.org/W2439127873","https://openalex.org/W2079887842","https://openalex.org/W2145610052","https://openalex.org/W3215430368","https://openalex.org/W2132199417","https://openalex.org/W1987507610"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}