| 一个关于Hamilton环（路）的多项式时间算法 |
| |
| 引用本文： | 杜立智.一个关于Hamilton环（路）的多项式时间算法[J].电脑与信息技术,2010,18(1):1-3,67. |
| |
| 作者姓名： | 杜立智 |
| |
| 作者单位： | 武汉科技大学计算机科学与技术学院,湖北武汉,430081 |
| |
| 摘 要： | 该研究为Hamilton环路（道路）问题设计出了一个多项式时间算法，论证了它的正确性。根据该算法编制了程序，进行了大量的实例计算。文章公布了主要研究方法、过程、实验数据，以及粗略的算法步骤。详细的算法步骤和证明将在随后的论文中发表。由于Hamilton环路（道路）为著名的NP完全问题，而作者认为自己已彻底解决了NP复杂问题。
|
| 关 键 词： | NP NP完全 P 计算机算法 Hamilton道路 Hamilton环路 |
A Polynomial Time Algorithm for Hamilton Cycle(Path) |
| |
| DU Li-zhi.A Polynomial Time Algorithm for Hamilton Cycle(Path)[J].Computer and Information Technology,2010,18(1):1-3,67. |
| |
| Authors: | DU Li-zhi |
| |
| Affiliation: | College of Computer Science and Technology;Wuhan University of Science and Technology;Wuhan 430081;China |
| |
| Abstract: | This research develops a polynomial time algorithm for Hamilton Cycle(Path) and proves its correctness.A program is developed according to this algorithm and it works well.This paper declares the research process,the algorithm sketch,and the experiment data.Exact algorithm and its proof will be declared in next paper.Due to that Hamilton Cycle(Path) is a famous NP Complete problem,I think I have solved the NP problem utterly. |
| |
| Keywords: | NP NP Complete P Computer Algorithm Hamilton Path Hamilton Cycle |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
