{"id":"https://openalex.org/W4313561101","doi":"https://doi.org/10.1080/10556788.2022.2157001","title":"A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes","display_name":"A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes","publication_year":2023,"publication_date":"2023-01-05","ids":{"openalex":"https://openalex.org/W4313561101","doi":"https://doi.org/10.1080/10556788.2022.2157001"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2022.2157001","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2022.2157001","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5065431653","display_name":"Fatemeh Keshavarz-Kohjerdi","orcid":"https://orcid.org/0000-0002-7006-2675"},"institutions":[{"id":"https://openalex.org/I119025939","display_name":"Shahed University","ror":"https://ror.org/01e8ff003","country_code":"IR","type":"education","lineage":["https://openalex.org/I119025939"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Fatemeh Keshavarz-Kohjerdi","raw_affiliation_strings":["Department of Computer Science, Shahed University, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Shahed University, Tehran, Iran","institution_ids":["https://openalex.org/I119025939"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074487575","display_name":"Alireza Bagheri","orcid":"https://orcid.org/0000-0002-3542-7763"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Bagheri","raw_affiliation_strings":["Department of Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065431653"],"corresponding_institution_ids":["https://openalex.org/I119025939"],"apc_list":null,"apc_paid":null,"fwci":0.3509,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54859979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"38","issue":"3","first_page":"591","last_page":"625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9890000224113464,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9890000224113464,"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.9789999723434448,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9735000133514404,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.713231086730957},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6976052522659302},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6697709560394287},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5918861031532288},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5695594549179077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5095891952514648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5088794231414795},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4937795102596283},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.4867000877857208},{"id":"https://openalex.org/keywords/lattice-graph","display_name":"Lattice graph","score":0.4556137025356293},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.43617311120033264},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.42741820216178894},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.42528235912323},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4082578718662262},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37626224756240845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3308355212211609},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30801135301589966},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2346043586730957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20152413845062256},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1764662265777588}],"concepts":[{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.713231086730957},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6976052522659302},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6697709560394287},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5918861031532288},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5695594549179077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5095891952514648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5088794231414795},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4937795102596283},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.4867000877857208},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.4556137025356293},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.43617311120033264},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.42741820216178894},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.42528235912323},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4082578718662262},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37626224756240845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3308355212211609},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30801135301589966},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2346043586730957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20152413845062256},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1764662265777588},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2022.2157001","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2022.2157001","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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":19,"referenced_works":["https://openalex.org/W96684974","https://openalex.org/W1596794201","https://openalex.org/W1989631462","https://openalex.org/W2005353392","https://openalex.org/W2011039300","https://openalex.org/W2055336889","https://openalex.org/W2075912342","https://openalex.org/W2078431586","https://openalex.org/W2080396663","https://openalex.org/W2091151333","https://openalex.org/W2188309853","https://openalex.org/W2282903323","https://openalex.org/W2591157879","https://openalex.org/W2623199383","https://openalex.org/W2963874483","https://openalex.org/W2971529185","https://openalex.org/W2972941522","https://openalex.org/W2991258747","https://openalex.org/W6827730362"],"related_works":["https://openalex.org/W2371794074","https://openalex.org/W2019758609","https://openalex.org/W2969955840","https://openalex.org/W1428816444","https://openalex.org/W4380369462","https://openalex.org/W4206195007","https://openalex.org/W1983755786","https://openalex.org/W2282903323","https://openalex.org/W1513129247","https://openalex.org/W203133463"],"abstract_inverted_index":{"The":[0,120],"Hamiltonian":[1,90,118],"cycle":[2,91],"problem":[3,19,133],"is":[4,20,88,122,134],"one":[5,76],"of":[6,35,131],"the":[7,48,68,82,132],"most":[8],"important":[9],"problems":[10],"in":[11,47,85,135],"graph":[12],"theory":[13],"that":[14,106],"has":[15,44],"many":[16],"applications.":[17],"This":[18,66],"NP-complete":[21],"for":[22,38,58,71,92],"general":[23],"grid":[24,28,39,60,73,94,98],"graphs.":[25],"For":[26],"solid":[27],"graphs,":[29,95],"there":[30,87,115],"are":[31],"polynomial-time":[32,36],"algorithms.":[33],"Existence":[34],"algorithms":[37],"graphs":[40,61,74,99],"with":[41,62,75,100],"few":[42],"holes":[43],"been":[45],"asked":[46],"literature.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53],"give":[54],"a":[55,117],"linear-time":[56],"algorithm":[57],"rectangular":[59,64,72,77,97,101],"two":[63],"holes.":[65,102],"extends":[67],"previous":[69],"result":[70],"hole.":[78],"We":[79,103],"first":[80],"present":[81],"forbidden":[83,109],"conditions":[84,110],"which":[86],"no":[89],"any":[93],"including":[96],"then":[104,114],"show":[105],"if":[107],"these":[108],"do":[111],"not":[112],"hold,":[113],"exists":[116],"cycle.":[119],"proof":[121],"constructive,":[123],"therefore,":[124],"it":[125],"gives":[126],"an":[127],"algorithm.":[128],"An":[129],"application":[130],"off-line":[136],"robot":[137],"exploration.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}