{"title":"基于最小不可解结构的3COL实例系统生成","authors":"Kazunori Mizuno, S. Nishihara","doi":"10.1002/ECJC.20359","DOIUrl":null,"url":null,"abstract":"In this paper, the authors propose a method of systematically generating 3-colorable (3COL) graph instances for which a great deal of time and effort are required to obtain a solution (or to determine solvability). This method, which differs from the conventional approach of selecting hard instances from among randomly generated instances, aims to reliably generate hard problems by repeatedly embedding 3COL minimal unsolvable structures in the initial graph. The generated instances conform to various conditions of problems for which the solution searches that had been identified conventionally are extremely difficult. Also, the authors use several solution search algorithms to experimentally verify that the required effort is an exponential order of the number of vertices. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 27–35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20359","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"44 1","pages":"27-35"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Toward systematic generation of 3COL instances based on minimal unsolvable structures\",\"authors\":\"Kazunori Mizuno, S. Nishihara\",\"doi\":\"10.1002/ECJC.20359\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the authors propose a method of systematically generating 3-colorable (3COL) graph instances for which a great deal of time and effort are required to obtain a solution (or to determine solvability). This method, which differs from the conventional approach of selecting hard instances from among randomly generated instances, aims to reliably generate hard problems by repeatedly embedding 3COL minimal unsolvable structures in the initial graph. The generated instances conform to various conditions of problems for which the solution searches that had been identified conventionally are extremely difficult. Also, the authors use several solution search algorithms to experimentally verify that the required effort is an exponential order of the number of vertices. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 27–35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20359\",\"PeriodicalId\":100407,\"journal\":{\"name\":\"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)\",\"volume\":\"44 1\",\"pages\":\"27-35\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/ECJC.20359\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ECJC.20359","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Toward systematic generation of 3COL instances based on minimal unsolvable structures
In this paper, the authors propose a method of systematically generating 3-colorable (3COL) graph instances for which a great deal of time and effort are required to obtain a solution (or to determine solvability). This method, which differs from the conventional approach of selecting hard instances from among randomly generated instances, aims to reliably generate hard problems by repeatedly embedding 3COL minimal unsolvable structures in the initial graph. The generated instances conform to various conditions of problems for which the solution searches that had been identified conventionally are extremely difficult. Also, the authors use several solution search algorithms to experimentally verify that the required effort is an exponential order of the number of vertices. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(12): 27–35, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20359
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
