Research on Hamilton Graph Determining Algorithm

DOI

10.2991/icmmcce-15.2015.365How to use a DOI?

Keywords

Hamilton graph, Heuristic Search algorithm

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".

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hai Liu
AU  - Ying Ai Tian
AU  - Fang Feng HU
AU  - Jiong Xing Jin
PY  - 2015/12
DA  - 2015/12
TI  - Research on Hamilton Graph Determining Algorithm
BT  - Proceedings of the 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering 2015
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmcce-15.2015.365
DO  - 10.2991/icmmcce-15.2015.365
ID  - Liu2015/12
ER  -