{"id":"https://openalex.org/W2131762752","doi":"https://doi.org/10.1016/0166-218x(83)90042-2","title":"An approximation algorithm for the hamiltonian walk problem on maximal planar graphs","display_name":"An approximation algorithm for the hamiltonian walk problem on maximal planar graphs","publication_year":1983,"publication_date":"1983-02-01","ids":{"openalex":"https://openalex.org/W2131762752","doi":"https://doi.org/10.1016/0166-218x(83)90042-2","mag":"2131762752"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(83)90042-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(83)90042-2","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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/A5033580185","display_name":"Takao Nishizeki","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takao Nishizeki","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102080075","display_name":"Takao Asano","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takao Asano","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079132507","display_name":"Takahiro Watanabe","orcid":"https://orcid.org/0000-0002-7249-8106"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takahiro Watanabe","raw_affiliation_strings":["Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980","institution_ids":["https://openalex.org/I201537933"]},{"raw_affiliation_string":"Department of Electrical Communications, Faculty of Engineering, Tohoku University, Sendai, Japan 980#TAB#","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.5717,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.68349754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"5","issue":"2","first_page":"211","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.9975000023841858,"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.9923999905586243,"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/mathematics","display_name":"Mathematics","score":0.8117286562919617},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7058806419372559},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6270716190338135},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6014042496681213},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5452899932861328},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.505122721195221},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48625051975250244},{"id":"https://openalex.org/keywords/self-avoiding-walk","display_name":"Self-avoiding walk","score":0.4504963159561157},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4116281569004059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35808688402175903},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.2483128309249878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2440958023071289}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8117286562919617},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7058806419372559},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6270716190338135},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6014042496681213},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5452899932861328},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.505122721195221},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48625051975250244},{"id":"https://openalex.org/C155155215","wikidata":"https://www.wikidata.org/wiki/Q7448025","display_name":"Self-avoiding walk","level":3,"score":0.4504963159561157},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4116281569004059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35808688402175903},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.2483128309249878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2440958023071289},{"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/0166-218x(83)90042-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(83)90042-2","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"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":"Discrete Applied Mathematics","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":10,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1987374783","https://openalex.org/W1992467241","https://openalex.org/W2003073299","https://openalex.org/W2012463371","https://openalex.org/W2050065904","https://openalex.org/W2087818742","https://openalex.org/W2089773331","https://openalex.org/W2799004609","https://openalex.org/W4237169760"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W1618127724","https://openalex.org/W4299647289","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957","https://openalex.org/W140019436","https://openalex.org/W2027410688"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}