{"id":"https://openalex.org/W2969955840","doi":"https://doi.org/10.3390/a15020061","title":"Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time","display_name":"Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time","publication_year":2022,"publication_date":"2022-02-13","ids":{"openalex":"https://openalex.org/W2969955840","doi":"https://doi.org/10.3390/a15020061","mag":"2969955840"},"language":"en","primary_location":{"id":"doi:10.3390/a15020061","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020061","pdf_url":"https://www.mdpi.com/1999-4893/15/2/61/pdf?version=1645066940","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/2/61/pdf?version=1645066940","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Fatemeh Keshavarz-Kohjerdi","raw_affiliation_strings":["Department of Mathematics and Computer Science, Shahed University, Tehran 3319118651, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Shahed University, Tehran 3319118651, Iran","institution_ids":["https://openalex.org/I119025939"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073783297","display_name":"Ruo-Wei Hung","orcid":"https://orcid.org/0000-0001-5803-2265"},"institutions":[{"id":"https://openalex.org/I126145234","display_name":"Chaoyang University of Technology","ror":"https://ror.org/04xwksx09","country_code":"TW","type":"education","lineage":["https://openalex.org/I126145234"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ruo-Wei Hung","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Chaoyang University of Technology, Wufeng, Taichung 413310, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Wufeng, Taichung 413310, Taiwan","institution_ids":["https://openalex.org/I126145234"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073783297"],"corresponding_institution_ids":["https://openalex.org/I126145234"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.1416,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78152738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"15","issue":"2","first_page":"61","last_page":"61"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.7809354066848755},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.752487301826477},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6337994337081909},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6123248338699341},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5740804672241211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5723176002502441},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.5623522996902466},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.49223700165748596},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44581109285354614},{"id":"https://openalex.org/keywords/image-stitching","display_name":"Image stitching","score":0.42358097434043884},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3260893225669861},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3003818988800049},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27664512395858765},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.20157429575920105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.09981968998908997}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7809354066848755},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.752487301826477},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6337994337081909},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6123248338699341},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5740804672241211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5723176002502441},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.5623522996902466},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.49223700165748596},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44581109285354614},{"id":"https://openalex.org/C29081049","wikidata":"https://www.wikidata.org/wiki/Q1364242","display_name":"Image stitching","level":2,"score":0.42358097434043884},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3260893225669861},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3003818988800049},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27664512395858765},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.20157429575920105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.09981968998908997},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15020061","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020061","pdf_url":"https://www.mdpi.com/1999-4893/15/2/61/pdf?version=1645066940","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:3225da0ab67648ee8612fa79c580818d","is_oa":true,"landing_page_url":"https://doaj.org/article/3225da0ab67648ee8612fa79c580818d","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 2, p 61 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/2/61/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15020061","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 2; Pages: 61","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15020061","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15020061","pdf_url":"https://www.mdpi.com/1999-4893/15/2/61/pdf?version=1645066940","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1621845287","display_name":null,"funder_award_id":"MOST 110-2221-E-324-007-MY3","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"},{"id":"https://openalex.org/G6986101419","display_name":null,"funder_award_id":"110-2221-E-324-007-MY3","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"},{"id":"https://openalex.org/G7160539585","display_name":null,"funder_award_id":"Technology","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"},{"id":"https://openalex.org/G951433114","display_name":null,"funder_award_id":"007-MY3","funder_id":"https://openalex.org/F4320322795","funder_display_name":"Ministry of Science and Technology, Taiwan"}],"funders":[{"id":"https://openalex.org/F4320322795","display_name":"Ministry of Science and Technology, Taiwan","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2969955840.pdf","grobid_xml":"https://content.openalex.org/works/W2969955840.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1487168264","https://openalex.org/W1813313303","https://openalex.org/W1966101108","https://openalex.org/W1976157781","https://openalex.org/W1989631462","https://openalex.org/W1992073055","https://openalex.org/W2005314985","https://openalex.org/W2011039300","https://openalex.org/W2019331588","https://openalex.org/W2023050191","https://openalex.org/W2027532246","https://openalex.org/W2027982508","https://openalex.org/W2028363955","https://openalex.org/W2030566470","https://openalex.org/W2042284661","https://openalex.org/W2042285030","https://openalex.org/W2045021308","https://openalex.org/W2047176418","https://openalex.org/W2047593890","https://openalex.org/W2052982152","https://openalex.org/W2054204410","https://openalex.org/W2055336889","https://openalex.org/W2056724312","https://openalex.org/W2058687965","https://openalex.org/W2060984605","https://openalex.org/W2071238773","https://openalex.org/W2075912342","https://openalex.org/W2080396663","https://openalex.org/W2086148955","https://openalex.org/W2087737831","https://openalex.org/W2091151333","https://openalex.org/W2111941291","https://openalex.org/W2119014043","https://openalex.org/W2122785676","https://openalex.org/W2143474538","https://openalex.org/W2153605009","https://openalex.org/W2162053220","https://openalex.org/W2188309853","https://openalex.org/W2282903323","https://openalex.org/W2305594400","https://openalex.org/W2725940624","https://openalex.org/W2783794245","https://openalex.org/W2804569660","https://openalex.org/W2911302472","https://openalex.org/W2928534012","https://openalex.org/W2963874483","https://openalex.org/W2981843604","https://openalex.org/W3011648644","https://openalex.org/W3017316342","https://openalex.org/W4288375650"],"related_works":["https://openalex.org/W1618127724","https://openalex.org/W2952856011","https://openalex.org/W2019758609","https://openalex.org/W3010627705","https://openalex.org/W2046852387","https://openalex.org/W2928534012","https://openalex.org/W203133463","https://openalex.org/W1428816444","https://openalex.org/W4288375650","https://openalex.org/W2969955840"],"abstract_inverted_index":{"A":[0],"graph":[1],"is":[2],"called":[3],"Hamiltonian":[4,10,23,52,76,88,111],"connected":[5,77],"if":[6],"it":[7],"contains":[8],"a":[9,61,80,98,140],"path":[11,24,105],"between":[12],"any":[13],"two":[14],"distinct":[15],"vertices.":[16],"In":[17,44],"the":[18,22,51,103,122,132],"past,":[19],"we":[20,48,69,90,96],"proved":[21],"and":[25,130],"cycle":[26,53],"problems":[27],"for":[28,40],"general":[29],"supergrid":[30,42,57,66,73,115],"graphs":[31,74,116],"to":[32,101,120],"be":[33,118],"NP-complete.":[34],"However,":[35],"they":[36],"are":[37,60,75],"still":[38],"open":[39],"solid":[41,65],"graphs.":[43,67,109],"this":[45],"paper,":[46],"first":[47],"will":[49],"verify":[50],"property":[54],"of":[55,64,87,113,126,136],"C-shaped":[56,72,114],"graphs,":[58],"which":[59],"special":[62],"case":[63],"Next,":[68],"show":[70],"that":[71],"except":[78],"in":[79,107],"few":[81],"conditions.":[82],"For":[83],"these":[84,108],"excluding":[85],"conditions":[86],"connectivity,":[89],"compute":[91,121],"their":[92],"longest":[93,104],"paths.":[94],"Then,":[95],"design":[97],"linear-time":[99],"algorithm":[100],"solve":[102],"problem":[106],"The":[110],"connectivity":[112],"can":[117],"applied":[119],"optimal":[123],"stitching":[124],"trace":[125,135],"computer":[127],"embroidery":[128],"machines,":[129],"construct":[131],"minimum":[133],"printing":[134],"3D":[137],"printers":[138],"with":[139],"C-like":[141],"component":[142],"being":[143],"printed.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2019-08-29T00:00:00"}