计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (26): 76-78.

• 学术探讨 • 上一篇    下一篇

基于粘贴系统的有向哈密顿路问题分析

王 伟1,殷志祥1,2   

  1. 1.安徽理工大学 数理系,安徽 淮南 232001
    2.华中科技大学 控制科学与工程系,武汉430074
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-11 发布日期:2007-09-11
  • 通讯作者: 王 伟

Analysis for directed Hamilton path problems based on sticker systems

WANG Wei1,YIN Zhi-xiang1,2   

  1. 1.Department of Math. and Physics,Anhui University of Science & Technology,Huainan,Anhui 232001,China
    2.Department of Control Science and Engineering,Huazhong University of Science & Technology,Wuhan 430074,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-11 Published:2007-09-11
  • Contact: WANG Wei

摘要: 通过构造粘贴模型模拟解决有向哈密顿路问题,然后用此粘贴系统所产生语言的性质对有向哈密顿路问题进行分析,继而给出了有向哈密顿路的充要条件。对于规模为n有向哈密顿路问题,构造的粘贴系统至多运行n-1步。

关键词: DNA计算, 粘贴模型, 有向哈密顿路问题

Abstract: Through constructs the sticker model to simulate solves directed Hamilton path problems.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 sticker systems.For a size n directed Hamilton path problem,the sticker system which constructs run at most n-1 steps.

Key words: DNA computing, sticker system, directed Hamilton path problem