{"id":"https://openalex.org/W2152275289","doi":"https://doi.org/10.1142/s1793830912500577","title":"EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS","display_name":"EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS","publication_year":2012,"publication_date":"2012-10-29","ids":{"openalex":"https://openalex.org/W2152275289","doi":"https://doi.org/10.1142/s1793830912500577","mag":"2152275289"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500577","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500577","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5089239427","display_name":"Blanca Isabel Niel","orcid":null},"institutions":[{"id":"https://openalex.org/I56858762","display_name":"Universidad Nacional del Sur","ror":"https://ror.org/028crwz56","country_code":"AR","type":"education","lineage":["https://openalex.org/I56858762"]}],"countries":["AR"],"is_corresponding":true,"raw_author_name":"BLANCA I. NIEL","raw_affiliation_strings":["Departamento de Matem\u00e1tica, Universidad Nacional del Sur (UNS), Av. Alem 1253, Bah\u00eda Blanca (B8000CPB), Argentina"],"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, Universidad Nacional del Sur (UNS), Av. Alem 1253, Bah\u00eda Blanca (B8000CPB), Argentina","institution_ids":["https://openalex.org/I56858762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089239427"],"corresponding_institution_ids":["https://openalex.org/I56858762"],"apc_list":null,"apc_paid":null,"fwci":0.4053,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69614822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"04","issue":"04","first_page":"1250057","last_page":"1250057"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9574000239372253,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.8506073355674744},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.7451711893081665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7353518009185791},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6663116812705994},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6639994382858276},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6230698227882385},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6147321462631226},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.5467180609703064},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5273557305335999},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.42131534218788147},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.2142351269721985},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19160136580467224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1753338873386383},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13418802618980408},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08169946074485779}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8506073355674744},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.7451711893081665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7353518009185791},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6663116812705994},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6639994382858276},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6230698227882385},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6147321462631226},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.5467180609703064},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5273557305335999},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.42131534218788147},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2142351269721985},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19160136580467224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1753338873386383},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13418802618980408},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08169946074485779},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830912500577","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500577","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W2152727633","https://openalex.org/W2497467085","https://openalex.org/W4240897641","https://openalex.org/W6608025442"],"related_works":["https://openalex.org/W4299647289","https://openalex.org/W2557802198","https://openalex.org/W4323364020","https://openalex.org/W2152275289","https://openalex.org/W3034468245","https://openalex.org/W2345891947","https://openalex.org/W2348429546","https://openalex.org/W2896581360","https://openalex.org/W2040876008","https://openalex.org/W2744732957"],"abstract_inverted_index":{"We":[0],"single":[1],"out":[2],"every":[3],"longest":[4],"path":[5],"of":[6,12,27,32,43,52],"n-1":[7],"order":[8],"that":[9,57],"solves":[10],"each":[11],"the":[13,23,28,50,53,59],"[Formula:":[14],"see":[15],"text]":[16],"Longest":[17],"Euclidean":[18,54],"Hamiltonian":[19,55],"Path":[20],"Problems":[21],"on":[22],"even":[24],"nth":[25],"root":[26],"unity,":[29],"by":[30],"means":[31],"a":[33],"geometric":[34],"and":[35,46],"arithmetic":[36],"procedure.":[37],"This":[38],"identification":[39],"is":[40,64],"done":[41],"regardless":[42],"planar":[44],"rotations":[45],"orientation.":[47],"In":[48],"addition,":[49],"uniqueness":[51],"cycle":[56],"resolves":[58],"Maximum":[60],"Traveling":[61],"Salesman":[62],"Problem":[63],"shown.":[65]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}