{"id":"https://openalex.org/W1977187614","doi":"https://doi.org/10.1016/0304-3975(94)90185-6","title":"Complexity of the hamiltonian cycle in regular graph problem","display_name":"Complexity of the hamiltonian cycle in regular graph problem","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W1977187614","doi":"https://doi.org/10.1016/0304-3975(94)90185-6","mag":"1977187614"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)90185-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90185-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397594901856/pdf","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":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/0304397594901856/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106792060","display_name":"C. Picouleau","orcid":null},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C. Picouleau","raw_affiliation_strings":["LITP, Universit\u00e9 P. et M. Curie, 4 place Jussieu, Tour 55-65 430-Bo\u00eete 168, F-75252 Paris Cedex 05, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LITP, Universit\u00e9 P. et M. Curie, 4 place Jussieu, Tour 55-65 430-Bo\u00eete 168, F-75252 Paris Cedex 05, France","institution_ids":["https://openalex.org/I39804081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5106792060"],"corresponding_institution_ids":["https://openalex.org/I39804081"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.09638972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"131","issue":"2","first_page":"463","last_page":"473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8515634536743164},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.8135733604431152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7314056754112244},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7064917087554932},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5426069498062134},{"id":"https://openalex.org/keywords/regular-graph","display_name":"Regular graph","score":0.5274895429611206},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5125083923339844},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46240168809890747},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.449550986289978},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42913779616355896},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.33827948570251465},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2662736177444458},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.12311601638793945}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8515634536743164},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.8135733604431152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7314056754112244},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7064917087554932},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5426069498062134},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.5274895429611206},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5125083923339844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46240168809890747},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.449550986289978},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42913779616355896},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.33827948570251465},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2662736177444458},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.12311601638793945}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0304-3975(94)90185-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90185-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397594901856/pdf","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"},{"id":"pmh:oai:HAL:hal-02436852v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02436852","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 1994, 131 (2), pp.463-473. ⟨10.1016/0304-3975(94)90185-6⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/0304-3975(94)90185-6","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)90185-6","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397594901856/pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1977187614.pdf","grobid_xml":"https://content.openalex.org/works/W1977187614.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1530753374","https://openalex.org/W2011039300","https://openalex.org/W2087818742","https://openalex.org/W2577446513"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W2256329187","https://openalex.org/W2768859505","https://openalex.org/W4387272283","https://openalex.org/W2063001402","https://openalex.org/W2036803675","https://openalex.org/W2089894925","https://openalex.org/W2106934213","https://openalex.org/W1977187614","https://openalex.org/W2605498182"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}