1) directed Hamilton path problem
有向哈密顿路问题
1.
Analysis for directed Hamilton path problems based on sticker systems;
基于粘贴系统的有向哈密顿路问题分析
2.
<Abstrcat>The ideas of simulating directed Hamilton path problems by splicing systems are showed;then some properties of directed graphs are presented based on the analysis of directed Hamilton path problems according to the properties of languages generated by the splicing systems.
首先给出了剪接系统模拟有向哈密顿路问题的思想;然后通过此剪接系统所产生语言的性质对有向哈密顿路问题进行分析,给出了有向图存在哈密顿路的充要条件。
2) Hamilton path problem
哈密顿路径问题
1.
DNA algorithm of Hamilton path problem based on finite automaton;
哈密顿路径问题的一种基于有穷自动机的DNA算法
3) Hamiltanian path problem
哈密顿通路问题
4) directed Hamilton path
有向哈密顿路
1.
On the basis of analysing existed proofs,provides a new proof about the proposition that every tournament has a directed Hamilton path.
对于竞赛图中必有有向哈密顿路这一命题，在分析已有证明的基础上，给出了一种新的证明。
5) Hamilton circuit problem
哈密尔顿回路问题
1.
Finally,it puts forward the idea on handling the Hamilton circuit problem in the branch-and-bound method.
指出在实际应用算法时,根据问题的局部信息,模型与算法的选择是极其重要的,并进一步提出了借用分枝定界法处理哈密尔顿回路问题的设想。
6) Directed shortest Hamilton path
有向哈密尔顿最短路
