Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
•In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be Hamiltonian are given and a linear-time algorithm to find a Hamiltonian cycle, if there exists, is presented.•The Hamiltonian cycle problem fo...
Uložené v:
| Vydané v: | Applied mathematics and computation Ročník 436; s. 127513 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.01.2023
|
| Predmet: | |
| ISSN: | 0096-3003, 1873-5649 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be Hamiltonian are given and a linear-time algorithm to find a Hamiltonian cycle, if there exists, is presented.•The Hamiltonian cycle problem for solid grid graphs has been solved already in time O(n4) but we solved it in less time complexity for truncated rectangular grid graphs.
The Hamiltonian cycle problem is an important problem in graph theory. For solid grid graphs, an O(n4)-time algorithm has been given. In this paper, we solve the problem for a special class of solid grid graphs, i.e. truncated rectangular grid graphs, in linear time. |
|---|---|
| AbstractList | •In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be Hamiltonian are given and a linear-time algorithm to find a Hamiltonian cycle, if there exists, is presented.•The Hamiltonian cycle problem for solid grid graphs has been solved already in time O(n4) but we solved it in less time complexity for truncated rectangular grid graphs.
The Hamiltonian cycle problem is an important problem in graph theory. For solid grid graphs, an O(n4)-time algorithm has been given. In this paper, we solve the problem for a special class of solid grid graphs, i.e. truncated rectangular grid graphs, in linear time. |
| ArticleNumber | 127513 |
| Author | Bagheri, Alireza Keshavarz-Kohjerdi, Fatemeh |
| Author_xml | – sequence: 1 givenname: Fatemeh surname: Keshavarz-Kohjerdi fullname: Keshavarz-Kohjerdi, Fatemeh email: f.keshavarz@shahed.ac.ir organization: Department of Computer Science, Shahed University, Tehran, Iran – sequence: 2 givenname: Alireza surname: Bagheri fullname: Bagheri, Alireza email: ar_bagheri@aut.ac.ir organization: Department of Computer Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran |
| BookMark | eNp9kMFKAzEQhoNUsK0-gLe8wK6ZZHfT4EmKtULRi55DyCZ1ym62JKnQt3dLPfXQywzzwzfMfDMyCUNwhDwCK4FB87QrTW9LzjgvgcsaxA2ZwkKKom4qNSFTxlRTCMbEHZmltGOMyQaqKflYYWgxbOna9NjlIaAJ1B5t5xIdPM3xEKzJrqXR2WzC9tCZSLcR27GY_U-iGGiHwY1pxt7dk1tvuuQe_vucfK9ev5brYvP59r582RSWc5kLqZq68ny8wYkGOAA00no1Dn6hagBRKW9qyYXlZtGamlkFnhkrwKpKSCbmBM57bRxSis7rfcTexKMGpk9C9E6PQvRJiD4LGRl5wVjMJuMQcjTYXSWfz6QbX_pFF3Wy6IJ1LZ606HbAK_Qfa-d7wA |
| CitedBy_id | crossref_primary_10_1109_TPDS_2024_3445283 crossref_primary_10_3390_math11112587 |
| Cites_doi | 10.1016/S0167-8191(02)00135-7 10.1016/j.tcs.2016.01.024 10.1016/j.ipl.2004.12.002 10.1137/0211056 10.1137/0405046 10.1007/s11464-009-0017-5 10.1016/j.comgeo.2008.11.004 10.1002/jgt.22508 10.1051/ita/1994280605671 |
| ContentType | Journal Article |
| Copyright | 2022 Elsevier Inc. |
| Copyright_xml | – notice: 2022 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.amc.2022.127513 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| ExternalDocumentID | 10_1016_j_amc_2022_127513 S0096300322005872 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAXUO ABAOU ABFNM ABFRF ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RNS ROL RPZ RXW SBC SDF SDG SES SME SPC SPCBC SSW SSZ T5K TN5 WH7 X6Y XPP ZMT ~02 ~G- 5VS 9DU AAQFI AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ABXDB ACLOT ACRPL ACVFH ADCNI ADIYS ADMUD ADNMO AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB G-2 HLZ HMJ HVGLF HZ~ R2- SEW TAE VH1 VOH WUQ ~HD |
| ID | FETCH-LOGICAL-c227t-79654f2076e361211167cf9e36f89511349fa5723c2a8da50c91f0ac31c943703 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000864697000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0096-3003 |
| IngestDate | Sat Nov 29 07:23:51 EST 2025 Tue Nov 18 20:47:22 EST 2025 Fri Feb 23 02:40:08 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Truncated rectangular grid graphs 05C45 05C85 Hamiltonian cycle problem Solid grid graph 68T40 05C38 Linear-time algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c227t-79654f2076e361211167cf9e36f89511349fa5723c2a8da50c91f0ac31c943703 |
| ParticipantIDs | crossref_primary_10_1016_j_amc_2022_127513 crossref_citationtrail_10_1016_j_amc_2022_127513 elsevier_sciencedirect_doi_10_1016_j_amc_2022_127513 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-01 2023-01-00 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2023 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Salman, Baskoro, Broersma (bib0014) 2003; 35 Salman, Baskoro, Broersma (bib0015) 2002; 8 Keshavarz-Kohjerdi (bib0011) 2021 Itai, Papadimitriou, Szwarcfiter (bib0009) 1982; 11 DeBiasio, Krueger, Pritikin, Thompson (bib0005) 2020; 94 Icking, Kamphans, Klein, Langetepe (bib0008) 2005 Hou, Lynch (bib0007) 2018 Cleemput, Zamfirescu (bib0017) 2018; 338 Chen, Shen, Topor (bib0004) 2002; 28 Nishat, Whitesides (bib0012) 2019 Umans, Lenhart (bib0016) 1997 Bondy, Murty (bib0003) 1976 Garey, Johnson (bib0006) 1979 Rahman, Kaykobad (bib0013) 2005; 94 Arkin, Fekete, Islam, Meijer, Mitchell, Nunez-Rodriguez, Polishchuk, Rappaport, Xiao (bib0002) 2009; 42 Afrati (bib0001) 1994; 28 Keshavarz-Kohjerdi, Bagheri (bib0010) 2016; 621 Xu, Ma (bib0018) 2009; 4 Zamfirescu, Zamfirescu (bib0019) 1992; 5 Garey (10.1016/j.amc.2022.127513_bib0006) 1979 Bondy (10.1016/j.amc.2022.127513_bib0003) 1976 Rahman (10.1016/j.amc.2022.127513_bib0013) 2005; 94 Zamfirescu (10.1016/j.amc.2022.127513_bib0019) 1992; 5 Keshavarz-Kohjerdi (10.1016/j.amc.2022.127513_bib0010) 2016; 621 Salman (10.1016/j.amc.2022.127513_bib0015) 2002; 8 Afrati (10.1016/j.amc.2022.127513_bib0001) 1994; 28 Chen (10.1016/j.amc.2022.127513_bib0004) 2002; 28 Keshavarz-Kohjerdi (10.1016/j.amc.2022.127513_bib0011) 2021 Hou (10.1016/j.amc.2022.127513_bib0007) 2018 Salman (10.1016/j.amc.2022.127513_bib0014) 2003; 35 Cleemput (10.1016/j.amc.2022.127513_bib0017) 2018; 338 DeBiasio (10.1016/j.amc.2022.127513_bib0005) 2020; 94 Nishat (10.1016/j.amc.2022.127513_bib0012) 2019 Arkin (10.1016/j.amc.2022.127513_bib0002) 2009; 42 Xu (10.1016/j.amc.2022.127513_bib0018) 2009; 4 Icking (10.1016/j.amc.2022.127513_bib0008) 2005 Umans (10.1016/j.amc.2022.127513_bib0016) 1997 Itai (10.1016/j.amc.2022.127513_bib0009) 1982; 11 |
| References_xml | – start-page: 524 year: 2005 end-page: 533 ident: bib0008 article-title: Exploring simple grid polygons publication-title: Proceedings of 11th Annual International Computing and Combinatorics Conference, COCOON, Kunming, China – volume: 338 start-page: 192 year: 2018 end-page: 206 ident: bib0017 article-title: Regular non-Hamiltonian polyhedral graphs publication-title: Appl. Math. Comput. – volume: 42 start-page: 582 year: 2009 end-page: 605 ident: bib0002 article-title: Not being (super)thin or solid is hard: a study of grid hamiltonicity publication-title: Comput. Geom. – volume: 28 start-page: 567 year: 1994 end-page: 582 ident: bib0001 article-title: The hamilton circuit problem on grids publication-title: RAIRO Theor. Inform. Appl. – volume: 5 start-page: 56 year: 1992 end-page: 570 ident: bib0019 article-title: Hamiltonian properties of grid graphs publication-title: SIAM J. Discrete Math. – volume: 35 start-page: 65 year: 2003 end-page: 70 ident: bib0014 article-title: A note concerning hamilton cycles in some classes of grid graphs publication-title: J. Math. Fund. Sci. – volume: 621 start-page: 37 year: 2016 end-page: 56 ident: bib0010 article-title: Hamiltonian paths in publication-title: Theor. Comput. Sci. – volume: 8 start-page: 63 year: 2002 end-page: 68 ident: bib0015 article-title: Spanning 2-connected subgraphs in truncated rectangular grid graphs publication-title: J. Indonesian Math. Soc. – volume: 94 start-page: 3 year: 2005 end-page: 41 ident: bib0013 article-title: On Hamiltonian cycles and Hamiltonian paths publication-title: Inf. Process. Lett. – volume: 4 start-page: 217 year: 2009 end-page: 252 ident: bib0018 article-title: Survey on path and cycle embedding in some networks publication-title: Front. Math. China – year: 1976 ident: bib0003 article-title: Graph Theory with Applications – start-page: 496 year: 1997 end-page: 505 ident: bib0016 article-title: Hamiltonian cycles in solid grid graphs publication-title: Proceedings of 38th Annual Symposium on Foundations of Computer Science, FOCS ’97, Miami Beach, Florida – year: 1979 ident: bib0006 publication-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – year: 2021 ident: bib0011 article-title: Off-line exploration of rectangular cellular environments with a rectangular obstacle publication-title: Optim. Methods Softw. – volume: 11 start-page: 676 year: 1982 end-page: 686 ident: bib0009 article-title: Hamiltonian paths in grid graphs publication-title: SIAM J. Comput. – volume: 94 start-page: 92 year: 2020 end-page: 112 ident: bib0005 article-title: Hamiltonian cycles in publication-title: J. Graph Theory – start-page: 325 year: 2019 end-page: 337 ident: bib0012 article-title: Reconfiguring Hamiltonian cycles in publication-title: International Proceedings of Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019: Graph-Theoretic Concepts in Computer Science – start-page: 114 year: 2018 end-page: 128 ident: bib0007 article-title: The computational complexity of finding Hamiltoniancycles in grid graphs of semiregular tessellations publication-title: Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG) – volume: 28 start-page: 1293 year: 2002 end-page: 1305 ident: bib0004 article-title: An efficient algorithm for constructing Hamiltonianpaths in meshes publication-title: Parallel Comput. – start-page: 114 year: 2018 ident: 10.1016/j.amc.2022.127513_bib0007 article-title: The computational complexity of finding Hamiltoniancycles in grid graphs of semiregular tessellations – start-page: 496 year: 1997 ident: 10.1016/j.amc.2022.127513_bib0016 article-title: Hamiltonian cycles in solid grid graphs – year: 2021 ident: 10.1016/j.amc.2022.127513_bib0011 article-title: Off-line exploration of rectangular cellular environments with a rectangular obstacle publication-title: Optim. Methods Softw. – volume: 338 start-page: 192 year: 2018 ident: 10.1016/j.amc.2022.127513_bib0017 article-title: Regular non-Hamiltonian polyhedral graphs publication-title: Appl. Math. Comput. – volume: 28 start-page: 1293 year: 2002 ident: 10.1016/j.amc.2022.127513_bib0004 article-title: An efficient algorithm for constructing Hamiltonianpaths in meshes publication-title: Parallel Comput. doi: 10.1016/S0167-8191(02)00135-7 – volume: 621 start-page: 37 year: 2016 ident: 10.1016/j.amc.2022.127513_bib0010 article-title: Hamiltonian paths in l-shaped grid graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2016.01.024 – volume: 8 start-page: 63 issue: 4 year: 2002 ident: 10.1016/j.amc.2022.127513_bib0015 article-title: Spanning 2-connected subgraphs in truncated rectangular grid graphs publication-title: J. Indonesian Math. Soc. – volume: 94 start-page: 3 issue: 1 year: 2005 ident: 10.1016/j.amc.2022.127513_bib0013 article-title: On Hamiltonian cycles and Hamiltonian paths publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2004.12.002 – volume: 11 start-page: 676 year: 1982 ident: 10.1016/j.amc.2022.127513_bib0009 article-title: Hamiltonian paths in grid graphs publication-title: SIAM J. Comput. doi: 10.1137/0211056 – year: 1979 ident: 10.1016/j.amc.2022.127513_bib0006 – volume: 5 start-page: 56 issue: 4 year: 1992 ident: 10.1016/j.amc.2022.127513_bib0019 article-title: Hamiltonian properties of grid graphs publication-title: SIAM J. Discrete Math. doi: 10.1137/0405046 – volume: 4 start-page: 217 year: 2009 ident: 10.1016/j.amc.2022.127513_bib0018 article-title: Survey on path and cycle embedding in some networks publication-title: Front. Math. China doi: 10.1007/s11464-009-0017-5 – start-page: 325 year: 2019 ident: 10.1016/j.amc.2022.127513_bib0012 article-title: Reconfiguring Hamiltonian cycles in l-shaped grid graphs – year: 1976 ident: 10.1016/j.amc.2022.127513_bib0003 – volume: 42 start-page: 582 issue: 6–7 year: 2009 ident: 10.1016/j.amc.2022.127513_bib0002 article-title: Not being (super)thin or solid is hard: a study of grid hamiltonicity publication-title: Comput. Geom. doi: 10.1016/j.comgeo.2008.11.004 – volume: 94 start-page: 92 issue: 1 year: 2020 ident: 10.1016/j.amc.2022.127513_bib0005 article-title: Hamiltonian cycles in k-partite graphs publication-title: J. Graph Theory doi: 10.1002/jgt.22508 – volume: 35 start-page: 65 issue: 1 year: 2003 ident: 10.1016/j.amc.2022.127513_bib0014 article-title: A note concerning hamilton cycles in some classes of grid graphs publication-title: J. Math. Fund. Sci. – volume: 28 start-page: 567 issue: 6 year: 1994 ident: 10.1016/j.amc.2022.127513_bib0001 article-title: The hamilton circuit problem on grids publication-title: RAIRO Theor. Inform. Appl. doi: 10.1051/ita/1994280605671 – start-page: 524 year: 2005 ident: 10.1016/j.amc.2022.127513_bib0008 article-title: Exploring simple grid polygons |
| SSID | ssj0007614 |
| Score | 2.4120145 |
| Snippet | •In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 127513 |
| SubjectTerms | Hamiltonian cycle problem Linear-time algorithm Solid grid graph Truncated rectangular grid graphs |
| Title | Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time |
| URI | https://dx.doi.org/10.1016/j.amc.2022.127513 |
| Volume | 436 |
| WOSCitedRecordID | wos000864697000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLbQxgM8IK5i3OQHnkCeEjuJ7ceBNo1bhcSQ-ha5vkAqmlZtN2379TsnTtJQLgIkXqLWiuvWn3v85fic7xDy3PnMca88mzidsww4MjMqODYJaVBpgA3aNiKu7-VopMZj_bGtirpqygnIulbn53rxX6GGNgAbU2f_Au7-Q6EBXgPocAXY4fpHwB9VMVHlGF0XwOzwH2wvMPitiQdYnqIMrMekFbtGZyWGoX5ZVu5lo13dhMci9YRWrDs_JK8dY531Uq-rLi1ucbp1pI8nSWdmecnezb9OPazChiXDwDPfO6BfGYwxqWKeDZjeSzP0QXCx5YPok2O-i93EpyMmkiTaLx_tq5KC5UVUKe0McBYlUH4w5tGvMN03M9Sa5HwfxehTsdm5-njCTzgWDsXRSaYk7Mm7cK8GM7d78OZw_LbfnGUR5d6779YddDchf1sD_ZyqDOjHyW1yq31uoAcR7zvkmq_vkpsfNkjcI6MWeTpAnkbk6TzQHnk6QJ4i8jQiT6uaRuQpIn-ffD46PHl9zNpyGcxyLtdM6iLPAoef6AXqwuEJmw0a3gQFPBp1KIPJJReWG-VMnlidhsRYkVqdCbD8D8hOPa_9Q0L5RCbOCZlbhyUIhLa60Dk0FTo1LlV7JOlmprStljyWNPlWdkGD0xIms8TJLONk7pEXfZdFFFL53c1ZN91lywQjwythbfy626N_6_aY3Ngs6idkB_DwT8l1e7auVstn7Qq6Ak2Qga8 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finding+Hamiltonian+cycles+of+truncated+rectangular+grid+graphs+in+linear+time&rft.jtitle=Applied+mathematics+and+computation&rft.au=Keshavarz-Kohjerdi%2C+Fatemeh&rft.au=Bagheri%2C+Alireza&rft.date=2023-01-01&rft.pub=Elsevier+Inc&rft.issn=0096-3003&rft.eissn=1873-5649&rft.volume=436&rft_id=info:doi/10.1016%2Fj.amc.2022.127513&rft.externalDocID=S0096300322005872 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |