{"title":"关于网格图的哈密顿性质","authors":"Yingtai Xie","doi":"10.1109/ICAA53760.2021.00009","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem constructing a Hamilton cycle in the grid graph. For the general grid graphs, this task is known to be NP-complete [A. Itai et.al [2]]. We propose a sufficient condition only for having a Hamilton cycle in a grid graph and a corresponding algorithm has been constructed. We generalize the result of Yingtai Xie [The Hamiltonian properties of rectangular meshes with at most two faulty nodes, Yingtai Xie 2020 J. Phys.: Conf. Ser.1646 012044].","PeriodicalId":121879,"journal":{"name":"2021 International Conference on Intelligent Computing, Automation and Applications (ICAA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Hamiltonian Properties of Grid Graph\",\"authors\":\"Yingtai Xie\",\"doi\":\"10.1109/ICAA53760.2021.00009\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem constructing a Hamilton cycle in the grid graph. For the general grid graphs, this task is known to be NP-complete [A. Itai et.al [2]]. We propose a sufficient condition only for having a Hamilton cycle in a grid graph and a corresponding algorithm has been constructed. We generalize the result of Yingtai Xie [The Hamiltonian properties of rectangular meshes with at most two faulty nodes, Yingtai Xie 2020 J. Phys.: Conf. Ser.1646 012044].\",\"PeriodicalId\":121879,\"journal\":{\"name\":\"2021 International Conference on Intelligent Computing, Automation and Applications (ICAA)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Intelligent Computing, Automation and Applications (ICAA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAA53760.2021.00009\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Intelligent Computing, Automation and Applications (ICAA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAA53760.2021.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper addresses the problem constructing a Hamilton cycle in the grid graph. For the general grid graphs, this task is known to be NP-complete [A. Itai et.al [2]]. We propose a sufficient condition only for having a Hamilton cycle in a grid graph and a corresponding algorithm has been constructed. We generalize the result of Yingtai Xie [The Hamiltonian properties of rectangular meshes with at most two faulty nodes, Yingtai Xie 2020 J. Phys.: Conf. Ser.1646 012044].
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
