1) hamilton path
哈密顿路
2) Hamiltonian path
哈密顿路
1.
Moreover,a theorem together with its algorithm referring to MBT was discussed under Hamiltonian path.
本文从哈密顿路(Hamiltonian Path)讨论了最少分叉树(Minimal Branch Tree)问题,并且给出最少分叉树(MBT)的定义和一个定理,进而讨论了它的求解算法。
3) Hamilton cycle
哈密顿回路
1.
A genetic algorithm for getting all Hamilton cycles of any graph;
用“遗传”算法求任意图的所有哈密顿回路
2.
Algorithm of cycle and recursion by every vertex for getting Hamilton cycle;
逐点循环递归法求哈密顿回路
4) Hamiltonian circuit
哈密顿回路
1.
The present paper puts forward the concepts about L sets, L matrices, joining products and path matrices, and also gives out some theorems for judging the existence of the Hamiltonian circuit based on these concepts.
给出L集合、L矩阵、连接积和通路矩阵的概念及基于这些概念的一些哈密顿回路的存在性判定定理和通过构造通路矩阵序列Mk=Mk－1*M（k=2，。
2.
The definitions of Hamiltonian circuit,subloop and family of cycles are given first,then a solving process and a necessary condition about Hamiltonian circuit are discussed.
首先给出哈密顿回路的定义以及子圈和圈族的定义，然后讨论了哈密顿回路的一个求解方法和一个必要条件。
5) hamiltonian path
哈密尔顿路
6) Hamilton circuit
哈密顿回路
1.
This paper purposes a new DNA algorithm of the Hamilton circuit problem based surface by using the method of fluorescence labeling.
论文采用荧光标记的策略,给出了一种新的哈密顿回路问题的DNA表面计算模型。
2.
The relationship between the Hamilton circuit and the Traveling Salesman Problem is discussed.
讨论了旅行售货员问题和图论中的哈密顿回路之间的关系,在此基础上结合图论中关于完全图最短路径的近似算法得到旅行售货员问题的一种近似算法。
