介绍 哈密顿圈(Hamiltonian cycle)图论术语：指图中包含所有顶点的圈。 一个图若含有哈密顿圈，则称为哈密顿图.
... Hamiltonian coordinate 哈密顿坐标 Hamiltonian cycle 哈密顿圈 ; 汉密顿循环 bilinear Hamiltonian 双线性哈密顿算符 ...
基于50个网页-相关网页
...刊—论文页面 关 键 词： 图论；哈密顿圈；多项式算法；堵塞流理论 [gap=938]Key words: graph theory; Hamiltonian circuit; polynomial algorithm; blocking flow theory ...
基于16个网页-相关网页
The independent cycles, 2-factor and path-factor theory in G are important problems in graph factorial theory, also they are the extending of Hamilton cycle theory.
图的独立圈、2-因子和路因子问题是图的因子理论中非常重要的一部分，也是图的哈密顿圈理论的推广和延伸。
参考来源 - 图中独立4·2,447,543篇论文数据，部分数据来源于NoteExpress
通过有向图的邻接矩阵的轨道来刻划图的哈密顿圈问题。
According to the orbit of adjoining matrix of directed graph the problem of Hamiltonian cycle is described.
作者曾提出利用王氏代数产生图的全部哈密顿圈，本文继续研究了这种算法。
In this paper the study of the algorithm which has been done by the author for generating all the Hamiltonian cycles in a graph by a method of Wang algebra is continued.
计算机科学数据库的关系中遇到了可归为倍图或补倍图的参数和哈密顿圈的问题。
In the relation of the database theory of the computer, we encounter some problems which can be translated into the problem for parameter and Hamilton cycle of double graphs or complement graphs.
应用推荐