Hamilton图确定算法的研究

International Congress of Mathematicans Pub Date : 2015-12-12 DOI:10.2991/ICMMCCE-15.2015.365

Hai Liu, Y. Tian, F. Hu, Jiong Xing Jin

{"title":"Hamilton图确定算法的研究","authors":"Hai Liu, Y. Tian, F. Hu, Jiong Xing Jin","doi":"10.2991/ICMMCCE-15.2015.365","DOIUrl":null,"url":null,"abstract":"This Paper sums up the necessary conditions to discriminate undirected Hamilton graph based on the in-depth research into the graph. The heuristic search strategy corresponding to the new necessary conditions is designed to quickly solve the problem of \"determination of undirected Hamilton graph\". The experimental results show that the heuristic search algorithm can effectively improve computing speed and make accurate determination of \"undirected Hamilton graph\".","PeriodicalId":270248,"journal":{"name":"International Congress of Mathematicans","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Hamilton Graph Determining Algorithm\",\"authors\":\"Hai Liu, Y. Tian, F. Hu, Jiong Xing Jin\",\"doi\":\"10.2991/ICMMCCE-15.2015.365\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This Paper sums up the necessary conditions to discriminate undirected Hamilton graph based on the in-depth research into the graph. The heuristic search strategy corresponding to the new necessary conditions is designed to quickly solve the problem of \\\"determination of undirected Hamilton graph\\\". The experimental results show that the heuristic search algorithm can effectively improve computing speed and make accurate determination of \\\"undirected Hamilton graph\\\".\",\"PeriodicalId\":270248,\"journal\":{\"name\":\"International Congress of Mathematicans\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Congress of Mathematicans\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2991/ICMMCCE-15.2015.365\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Congress of Mathematicans","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/ICMMCCE-15.2015.365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文在对无向汉密尔顿图进行深入研究的基础上，总结出判别无向汉密尔顿图的必要条件。设计了与新的必要条件相对应的启发式搜索策略，以快速解决“无向汉密尔顿图的确定”问题。实验结果表明，启发式搜索算法可以有效地提高计算速度，准确地确定“无向汉密尔顿图”。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Research on Hamilton Graph Determining Algorithm

This Paper sums up the necessary conditions to discriminate undirected Hamilton graph based on the in-depth research into the graph. The heuristic search strategy corresponding to the new necessary conditions is designed to quickly solve the problem of "determination of undirected Hamilton graph". The experimental results show that the heuristic search algorithm can effectively improve computing speed and make accurate determination of "undirected Hamilton graph".

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Congress of Mathematicans

自引率

0.00%

发文量