计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (28): 45-47.
• 研究、探讨 • 上一篇 下一篇
潘荷新1,伊崇信2,李 满2
收稿日期:
修回日期:
出版日期:
发布日期:
PAN Hexin1,YI Chongxin2,LI Man2
Received:
Revised:
Online:
Published:
摘要: 通过定义k元组合的方式给出了一个逐步搜索图(有向或元向)的全部Hamiltonan回路的新算法和判定图的哈密顿特性的充要条件。使用该算法可准确地求出Hamiltonan图的全部Hamiltonan回路,不必生成基本回路。
关键词: k元组合, 图, Hamiltonan回路
Abstract: It presents a novel algorithm increasingly searching all Hamiltonian cycles in a directed or undirected graph and the necessary and sufficient condition for Hamiltonian characteristics based on the definition of k-combination.The algorithm can discover all Hamiltonian cycles,where the basic cycles are not generated.
Key words: k-combination, graph, Hamiltonian cycle
潘荷新1,伊崇信2,李 满2. k元组合的Hamiltonan回路快速搜索算法[J]. 计算机工程与应用, 2011, 47(28): 45-47.
PAN Hexin1,YI Chongxin2,LI Man2. Quick search algorithm for all Hamiltonian cycles based on k-combination[J]. Computer Engineering and Applications, 2011, 47(28): 45-47.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/
http://cea.ceaj.org/CN/Y2011/V47/I28/45